/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --rcfgbuilder.size.of.a.code.block SingleStatement --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options produce-proofs=true --traceabstraction.additional.smt.options produce-unsat-cores=true --traceabstraction.additional.smt.options enumeration-timeout=5000 --traceabstraction.additional.smt.options interpolation-heuristic=HIGHLEXORDER --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-c90d42b
[2020-09-24 22:51:30,119 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-09-24 22:51:30,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-09-24 22:51:30,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-09-24 22:51:30,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-09-24 22:51:30,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-09-24 22:51:30,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-09-24 22:51:30,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-09-24 22:51:30,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-09-24 22:51:30,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-09-24 22:51:30,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-09-24 22:51:30,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-09-24 22:51:30,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-09-24 22:51:30,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-09-24 22:51:30,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-09-24 22:51:30,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-09-24 22:51:30,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-09-24 22:51:30,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-09-24 22:51:30,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-09-24 22:51:30,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-09-24 22:51:30,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-09-24 22:51:30,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-09-24 22:51:30,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-09-24 22:51:30,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-09-24 22:51:30,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-09-24 22:51:30,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-09-24 22:51:30,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-09-24 22:51:30,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-09-24 22:51:30,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-09-24 22:51:30,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-09-24 22:51:30,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-09-24 22:51:30,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-09-24 22:51:30,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-09-24 22:51:30,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-09-24 22:51:30,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-09-24 22:51:30,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-09-24 22:51:30,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-09-24 22:51:30,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-09-24 22:51:30,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-09-24 22:51:30,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-09-24 22:51:30,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-09-24 22:51:30,191 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-09-24 22:51:30,220 INFO L113 SettingsManager]: Loading preferences was successful
[2020-09-24 22:51:30,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-09-24 22:51:30,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-09-24 22:51:30,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2020-09-24 22:51:30,224 INFO L138 SettingsManager]: * Use SBE=true
[2020-09-24 22:51:30,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-09-24 22:51:30,224 INFO L138 SettingsManager]: * sizeof long=4
[2020-09-24 22:51:30,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-09-24 22:51:30,225 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-09-24 22:51:30,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-09-24 22:51:30,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-09-24 22:51:30,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-09-24 22:51:30,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-09-24 22:51:30,231 INFO L138 SettingsManager]: * sizeof long double=12
[2020-09-24 22:51:30,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-09-24 22:51:30,231 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-09-24 22:51:30,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-09-24 22:51:30,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-09-24 22:51:30,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2020-09-24 22:51:30,232 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-09-24 22:51:30,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-09-24 22:51:30,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-09-24 22:51:30,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-09-24 22:51:30,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2020-09-24 22:51:30,233 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-09-24 22:51:30,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2020-09-24 22:51:30,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-09-24 22:51:30,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-09-24 22:51:30,234 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2020-09-24 22:51:30,234 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=HIGHLEXORDER;log-additional-information=true;
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=HIGHLEXORDER;log-additional-information=true;
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=HIGHLEXORDER;log-additional-information=true;
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=HIGHLEXORDER;log-additional-information=true;
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=HIGHLEXORDER;log-additional-information=true;
[2020-09-24 22:51:30,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2020-09-24 22:51:30,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-09-24 22:51:30,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-09-24 22:51:30,782 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-09-24 22:51:30,783 INFO L275 PluginConnector]: CDTParser initialized
[2020-09-24 22:51:30,784 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c
[2020-09-24 22:51:30,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/53a8a8175/c784e331982f4870905f063938dd2026/FLAG2c405fb92
[2020-09-24 22:51:31,491 INFO L306 CDTParser]: Found 1 translation units.
[2020-09-24 22:51:31,492 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label42.c
[2020-09-24 22:51:31,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/53a8a8175/c784e331982f4870905f063938dd2026/FLAG2c405fb92
[2020-09-24 22:51:31,724 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/53a8a8175/c784e331982f4870905f063938dd2026
[2020-09-24 22:51:31,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-09-24 22:51:31,744 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2020-09-24 22:51:31,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-09-24 22:51:31,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-09-24 22:51:31,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-09-24 22:51:31,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 10:51:31" (1/1) ...
[2020-09-24 22:51:31,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47211fe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:51:31, skipping insertion in model container
[2020-09-24 22:51:31,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 10:51:31" (1/1) ...
[2020-09-24 22:51:31,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-09-24 22:51:31,819 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-09-24 22:51:32,390 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-09-24 22:51:32,396 INFO L203 MainTranslator]: Completed pre-run
[2020-09-24 22:51:32,494 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-09-24 22:51:32,514 INFO L208 MainTranslator]: Completed translation
[2020-09-24 22:51:32,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:51:32 WrapperNode
[2020-09-24 22:51:32,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-09-24 22:51:32,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-09-24 22:51:32,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-09-24 22:51:32,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-09-24 22:51:32,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:51:32" (1/1) ...
[2020-09-24 22:51:32,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:51:32" (1/1) ...
[2020-09-24 22:51:32,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:51:32" (1/1) ...
[2020-09-24 22:51:32,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:51:32" (1/1) ...
[2020-09-24 22:51:32,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:51:32" (1/1) ...
[2020-09-24 22:51:32,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:51:32" (1/1) ...
[2020-09-24 22:51:32,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:51:32" (1/1) ...
[2020-09-24 22:51:32,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-09-24 22:51:32,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-09-24 22:51:32,634 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-09-24 22:51:32,634 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-09-24 22:51:32,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:51:32" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-09-24 22:51:32,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-09-24 22:51:32,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-09-24 22:51:32,756 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output
[2020-09-24 22:51:32,756 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2020-09-24 22:51:32,756 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output
[2020-09-24 22:51:32,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-09-24 22:51:32,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-09-24 22:51:32,757 INFO L130 BoogieDeclarations]: Found specification of procedure exit
[2020-09-24 22:51:32,758 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2020-09-24 22:51:32,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-09-24 22:51:32,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-09-24 22:51:34,393 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-09-24 22:51:34,393 INFO L295 CfgBuilder]: Removed 1 assume(true) statements.
[2020-09-24 22:51:34,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 10:51:34 BoogieIcfgContainer
[2020-09-24 22:51:34,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-09-24 22:51:34,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-09-24 22:51:34,405 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-09-24 22:51:34,410 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-09-24 22:51:34,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 10:51:31" (1/3) ...
[2020-09-24 22:51:34,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4381e4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 10:51:34, skipping insertion in model container
[2020-09-24 22:51:34,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:51:32" (2/3) ...
[2020-09-24 22:51:34,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4381e4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 10:51:34, skipping insertion in model container
[2020-09-24 22:51:34,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 10:51:34" (3/3) ...
[2020-09-24 22:51:34,417 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label42.c
[2020-09-24 22:51:34,434 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-09-24 22:51:34,448 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-09-24 22:51:34,475 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-09-24 22:51:34,520 INFO L375 AbstractCegarLoop]: Interprodecural is true
[2020-09-24 22:51:34,520 INFO L376 AbstractCegarLoop]: Hoare is true
[2020-09-24 22:51:34,521 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-09-24 22:51:34,521 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-09-24 22:51:34,521 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-09-24 22:51:34,521 INFO L380 AbstractCegarLoop]: Difference is false
[2020-09-24 22:51:34,522 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-09-24 22:51:34,522 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-09-24 22:51:34,561 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states.
[2020-09-24 22:51:34,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2020-09-24 22:51:34,571 INFO L414 BasicCegarLoop]: Found error trace
[2020-09-24 22:51:34,573 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-09-24 22:51:34,573 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-09-24 22:51:34,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-09-24 22:51:34,584 INFO L82 PathProgramCache]: Analyzing trace with hash 969247631, now seen corresponding path program 1 times
[2020-09-24 22:51:34,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-09-24 22:51:34,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1895732269]
[2020-09-24 22:51:34,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-09-24 22:51:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-24 22:51:34,854 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:34,995 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:35,467 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000
[2020-09-24 22:51:35,468 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 45
[2020-09-24 22:51:35,468 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2
[2020-09-24 22:51:35,468 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 656
[2020-09-24 22:51:35,472 FATAL L256 erpolLogProxyWrapper]: Heuristic: HIGHLEXORDER
[2020-09-24 22:51:35,472 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6
[2020-09-24 22:51:35,473 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 12
[2020-09-24 22:51:35,473 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 32
[2020-09-24 22:51:35,473 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4
[2020-09-24 22:51:35,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-09-24 22:51:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-24 22:51:35,598 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:35,619 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000
[2020-09-24 22:51:35,620 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18
[2020-09-24 22:51:35,620 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1
[2020-09-24 22:51:35,621 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 24
[2020-09-24 22:51:35,621 FATAL L256 erpolLogProxyWrapper]: Heuristic: HIGHLEXORDER
[2020-09-24 22:51:35,621 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2
[2020-09-24 22:51:35,621 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2
[2020-09-24 22:51:35,622 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 8
[2020-09-24 22:51:35,622 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1
[2020-09-24 22:51:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-09-24 22:51:35,642 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1895732269]
[2020-09-24 22:51:35,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-09-24 22:51:35,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-09-24 22:51:35,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473388063]
[2020-09-24 22:51:35,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-09-24 22:51:35,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-09-24 22:51:35,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-09-24 22:51:35,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-09-24 22:51:35,683 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 4 states.
[2020-09-24 22:51:37,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-09-24 22:51:37,688 INFO L93 Difference]: Finished difference Result 1069 states and 1495 transitions.
[2020-09-24 22:51:37,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-09-24 22:51:37,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36
[2020-09-24 22:51:37,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-09-24 22:51:37,727 INFO L225 Difference]: With dead ends: 1069
[2020-09-24 22:51:37,727 INFO L226 Difference]: Without dead ends: 555
[2020-09-24 22:51:37,741 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-09-24 22:51:37,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states.
[2020-09-24 22:51:37,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 543.
[2020-09-24 22:51:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states.
[2020-09-24 22:51:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 695 transitions.
[2020-09-24 22:51:37,845 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 695 transitions. Word has length 36
[2020-09-24 22:51:37,846 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-09-24 22:51:37,846 INFO L479 AbstractCegarLoop]: Abstraction has 543 states and 695 transitions.
[2020-09-24 22:51:37,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-09-24 22:51:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 695 transitions.
[2020-09-24 22:51:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2020-09-24 22:51:37,853 INFO L414 BasicCegarLoop]: Found error trace
[2020-09-24 22:51:37,854 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-09-24 22:51:37,854 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-09-24 22:51:37,854 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-09-24 22:51:37,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-09-24 22:51:37,855 INFO L82 PathProgramCache]: Analyzing trace with hash -340660504, now seen corresponding path program 1 times
[2020-09-24 22:51:37,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-09-24 22:51:37,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [722484610]
[2020-09-24 22:51:37,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-09-24 22:51:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-24 22:51:37,943 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:38,166 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:38,624 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:38,689 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:39,384 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:39,453 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:42,053 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000
[2020-09-24 22:51:42,053 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 130
[2020-09-24 22:51:42,054 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 6
[2020-09-24 22:51:42,054 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4146
[2020-09-24 22:51:42,055 FATAL L256 erpolLogProxyWrapper]: Heuristic: HIGHLEXORDER
[2020-09-24 22:51:42,056 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4
[2020-09-24 22:51:42,056 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 99
[2020-09-24 22:51:42,056 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 30
[2020-09-24 22:51:42,056 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1
[2020-09-24 22:51:42,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-09-24 22:51:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-24 22:51:42,147 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:42,158 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000
[2020-09-24 22:51:42,159 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18
[2020-09-24 22:51:42,161 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1
[2020-09-24 22:51:42,166 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 13
[2020-09-24 22:51:42,166 FATAL L256 erpolLogProxyWrapper]: Heuristic: HIGHLEXORDER
[2020-09-24 22:51:42,166 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1
[2020-09-24 22:51:42,168 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2
[2020-09-24 22:51:42,169 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1
[2020-09-24 22:51:42,169 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2
[2020-09-24 22:51:42,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-09-24 22:51:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-24 22:51:42,241 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:42,325 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000
[2020-09-24 22:51:42,326 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 79
[2020-09-24 22:51:42,326 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1
[2020-09-24 22:51:42,327 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 100
[2020-09-24 22:51:42,327 FATAL L256 erpolLogProxyWrapper]: Heuristic: HIGHLEXORDER
[2020-09-24 22:51:42,328 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2
[2020-09-24 22:51:42,336 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2
[2020-09-24 22:51:42,336 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 70
[2020-09-24 22:51:42,337 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 9
[2020-09-24 22:51:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-09-24 22:51:42,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [722484610]
[2020-09-24 22:51:42,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-09-24 22:51:42,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2020-09-24 22:51:42,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029780047]
[2020-09-24 22:51:42,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-09-24 22:51:42,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-09-24 22:51:42,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-09-24 22:51:42,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-09-24 22:51:42,397 INFO L87 Difference]: Start difference. First operand 543 states and 695 transitions. Second operand 5 states.
[2020-09-24 22:51:44,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-09-24 22:51:44,464 INFO L93 Difference]: Finished difference Result 1397 states and 1883 transitions.
[2020-09-24 22:51:44,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-09-24 22:51:44,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119
[2020-09-24 22:51:44,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-09-24 22:51:44,471 INFO L225 Difference]: With dead ends: 1397
[2020-09-24 22:51:44,472 INFO L226 Difference]: Without dead ends: 869
[2020-09-24 22:51:44,475 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-09-24 22:51:44,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states.
[2020-09-24 22:51:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 847.
[2020-09-24 22:51:44,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states.
[2020-09-24 22:51:44,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1070 transitions.
[2020-09-24 22:51:44,523 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1070 transitions. Word has length 119
[2020-09-24 22:51:44,524 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-09-24 22:51:44,524 INFO L479 AbstractCegarLoop]: Abstraction has 847 states and 1070 transitions.
[2020-09-24 22:51:44,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-09-24 22:51:44,524 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1070 transitions.
[2020-09-24 22:51:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2020-09-24 22:51:44,529 INFO L414 BasicCegarLoop]: Found error trace
[2020-09-24 22:51:44,529 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-09-24 22:51:44,529 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-09-24 22:51:44,529 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-09-24 22:51:44,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-09-24 22:51:44,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1359994051, now seen corresponding path program 1 times
[2020-09-24 22:51:44,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-09-24 22:51:44,531 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1198376056]
[2020-09-24 22:51:44,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-09-24 22:51:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-24 22:51:44,596 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:44,834 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000
[2020-09-24 22:51:44,834 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 136
[2020-09-24 22:51:44,834 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1
[2020-09-24 22:51:44,835 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 267
[2020-09-24 22:51:44,835 FATAL L256 erpolLogProxyWrapper]: Heuristic: HIGHLEXORDER
[2020-09-24 22:51:44,835 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4
[2020-09-24 22:51:44,835 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 105
[2020-09-24 22:51:44,836 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 30
[2020-09-24 22:51:44,836 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0
[2020-09-24 22:51:44,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-09-24 22:51:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-24 22:51:44,907 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:44,916 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000
[2020-09-24 22:51:44,917 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18
[2020-09-24 22:51:44,917 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1
[2020-09-24 22:51:44,917 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10
[2020-09-24 22:51:44,917 FATAL L256 erpolLogProxyWrapper]: Heuristic: HIGHLEXORDER
[2020-09-24 22:51:44,918 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1
[2020-09-24 22:51:44,918 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2
[2020-09-24 22:51:44,918 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1
[2020-09-24 22:51:44,918 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0
[2020-09-24 22:51:44,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-09-24 22:51:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-24 22:51:44,972 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:45,063 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000
[2020-09-24 22:51:45,063 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 85
[2020-09-24 22:51:45,064 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1
[2020-09-24 22:51:45,064 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 109
[2020-09-24 22:51:45,064 FATAL L256 erpolLogProxyWrapper]: Heuristic: HIGHLEXORDER
[2020-09-24 22:51:45,064 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2
[2020-09-24 22:51:45,065 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2
[2020-09-24 22:51:45,065 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76
[2020-09-24 22:51:45,065 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0
[2020-09-24 22:51:45,118 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-09-24 22:51:45,119 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1198376056]
[2020-09-24 22:51:45,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-09-24 22:51:45,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2020-09-24 22:51:45,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56475230]
[2020-09-24 22:51:45,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-09-24 22:51:45,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-09-24 22:51:45,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-09-24 22:51:45,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-09-24 22:51:45,121 INFO L87 Difference]: Start difference. First operand 847 states and 1070 transitions. Second operand 5 states.
[2020-09-24 22:51:47,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-09-24 22:51:47,210 INFO L93 Difference]: Finished difference Result 2035 states and 2690 transitions.
[2020-09-24 22:51:47,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-09-24 22:51:47,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125
[2020-09-24 22:51:47,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-09-24 22:51:47,221 INFO L225 Difference]: With dead ends: 2035
[2020-09-24 22:51:47,222 INFO L226 Difference]: Without dead ends: 1203
[2020-09-24 22:51:47,226 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-09-24 22:51:47,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states.
[2020-09-24 22:51:47,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1151.
[2020-09-24 22:51:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states.
[2020-09-24 22:51:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1524 transitions.
[2020-09-24 22:51:47,319 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1524 transitions. Word has length 125
[2020-09-24 22:51:47,319 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-09-24 22:51:47,319 INFO L479 AbstractCegarLoop]: Abstraction has 1151 states and 1524 transitions.
[2020-09-24 22:51:47,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-09-24 22:51:47,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1524 transitions.
[2020-09-24 22:51:47,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159
[2020-09-24 22:51:47,327 INFO L414 BasicCegarLoop]: Found error trace
[2020-09-24 22:51:47,327 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-09-24 22:51:47,327 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-09-24 22:51:47,328 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-09-24 22:51:47,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-09-24 22:51:47,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1182078239, now seen corresponding path program 1 times
[2020-09-24 22:51:47,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-09-24 22:51:47,329 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [747774450]
[2020-09-24 22:51:47,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-09-24 22:51:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-24 22:51:47,402 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:47,857 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000
[2020-09-24 22:51:47,857 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 169
[2020-09-24 22:51:47,858 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1
[2020-09-24 22:51:47,858 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 488
[2020-09-24 22:51:47,858 FATAL L256 erpolLogProxyWrapper]: Heuristic: HIGHLEXORDER
[2020-09-24 22:51:47,858 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6
[2020-09-24 22:51:47,858 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 13
[2020-09-24 22:51:47,859 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 124
[2020-09-24 22:51:47,859 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0
[2020-09-24 22:51:47,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-09-24 22:51:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-24 22:51:47,944 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:47,958 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000
[2020-09-24 22:51:47,959 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18
[2020-09-24 22:51:47,959 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1
[2020-09-24 22:51:47,960 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 16
[2020-09-24 22:51:47,960 FATAL L256 erpolLogProxyWrapper]: Heuristic: HIGHLEXORDER
[2020-09-24 22:51:47,960 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2
[2020-09-24 22:51:47,960 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2
[2020-09-24 22:51:47,961 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 9
[2020-09-24 22:51:47,961 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0
[2020-09-24 22:51:47,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-09-24 22:51:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-24 22:51:48,030 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:48,237 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000
[2020-09-24 22:51:48,237 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118
[2020-09-24 22:51:48,237 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1
[2020-09-24 22:51:48,238 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 231
[2020-09-24 22:51:48,238 FATAL L256 erpolLogProxyWrapper]: Heuristic: HIGHLEXORDER
[2020-09-24 22:51:48,238 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4
[2020-09-24 22:51:48,238 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1
[2020-09-24 22:51:48,238 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 117
[2020-09-24 22:51:48,239 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0
[2020-09-24 22:51:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-09-24 22:51:48,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [747774450]
[2020-09-24 22:51:48,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-09-24 22:51:48,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-09-24 22:51:48,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398875579]
[2020-09-24 22:51:48,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-09-24 22:51:48,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-09-24 22:51:48,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-09-24 22:51:48,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2020-09-24 22:51:48,387 INFO L87 Difference]: Start difference. First operand 1151 states and 1524 transitions. Second operand 7 states.
[2020-09-24 22:51:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-09-24 22:51:50,250 INFO L93 Difference]: Finished difference Result 2365 states and 3175 transitions.
[2020-09-24 22:51:50,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2020-09-24 22:51:50,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158
[2020-09-24 22:51:50,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-09-24 22:51:50,259 INFO L225 Difference]: With dead ends: 2365
[2020-09-24 22:51:50,259 INFO L226 Difference]: Without dead ends: 1229
[2020-09-24 22:51:50,265 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132
[2020-09-24 22:51:50,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states.
[2020-09-24 22:51:50,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 865.
[2020-09-24 22:51:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states.
[2020-09-24 22:51:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1009 transitions.
[2020-09-24 22:51:50,300 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1009 transitions. Word has length 158
[2020-09-24 22:51:50,300 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-09-24 22:51:50,301 INFO L479 AbstractCegarLoop]: Abstraction has 865 states and 1009 transitions.
[2020-09-24 22:51:50,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-09-24 22:51:50,301 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1009 transitions.
[2020-09-24 22:51:50,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164
[2020-09-24 22:51:50,303 INFO L414 BasicCegarLoop]: Found error trace
[2020-09-24 22:51:50,304 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-09-24 22:51:50,304 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-09-24 22:51:50,304 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-09-24 22:51:50,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-09-24 22:51:50,304 INFO L82 PathProgramCache]: Analyzing trace with hash -81614816, now seen corresponding path program 1 times
[2020-09-24 22:51:50,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-09-24 22:51:50,305 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [101318385]
[2020-09-24 22:51:50,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-09-24 22:51:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-24 22:51:50,380 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:50,670 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:51,890 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000
[2020-09-24 22:51:51,890 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 174
[2020-09-24 22:51:51,891 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2
[2020-09-24 22:51:51,891 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1545
[2020-09-24 22:51:51,892 FATAL L256 erpolLogProxyWrapper]: Heuristic: HIGHLEXORDER
[2020-09-24 22:51:51,892 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4
[2020-09-24 22:51:51,892 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 142
[2020-09-24 22:51:51,893 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 31
[2020-09-24 22:51:51,893 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1
[2020-09-24 22:51:51,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-09-24 22:51:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-24 22:51:51,987 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:51,995 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000
[2020-09-24 22:51:51,996 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18
[2020-09-24 22:51:51,996 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1
[2020-09-24 22:51:51,996 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10
[2020-09-24 22:51:51,996 FATAL L256 erpolLogProxyWrapper]: Heuristic: HIGHLEXORDER
[2020-09-24 22:51:51,997 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1
[2020-09-24 22:51:51,997 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2
[2020-09-24 22:51:51,997 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1
[2020-09-24 22:51:51,997 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0
[2020-09-24 22:51:52,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-09-24 22:51:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-24 22:51:52,066 FATAL L256 erpolLogProxyWrapper]: Now shrinking...
[2020-09-24 22:51:52,177 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000
[2020-09-24 22:51:52,177 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 123
[2020-09-24 22:51:52,178 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1
[2020-09-24 22:51:52,178 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 136
[2020-09-24 22:51:52,178 FATAL L256 erpolLogProxyWrapper]: Heuristic: HIGHLEXORDER
[2020-09-24 22:51:52,178 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2
[2020-09-24 22:51:52,179 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2
[2020-09-24 22:51:52,179 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 113
[2020-09-24 22:51:52,179 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0
[2020-09-24 22:51:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-09-24 22:51:52,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [101318385]
[2020-09-24 22:51:52,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-09-24 22:51:52,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2020-09-24 22:51:52,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582331426]
[2020-09-24 22:51:52,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-09-24 22:51:52,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-09-24 22:51:52,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-09-24 22:51:52,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-09-24 22:51:52,253 INFO L87 Difference]: Start difference. First operand 865 states and 1009 transitions. Second operand 5 states.
[2020-09-24 22:51:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-09-24 22:51:54,260 INFO L93 Difference]: Finished difference Result 2402 states and 2875 transitions.
[2020-09-24 22:51:54,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-09-24 22:51:54,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163
[2020-09-24 22:51:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-09-24 22:51:54,269 INFO L225 Difference]: With dead ends: 2402
[2020-09-24 22:51:54,270 INFO L226 Difference]: Without dead ends: 1552
[2020-09-24 22:51:54,273 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-09-24 22:51:54,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states.
[2020-09-24 22:51:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1347.
[2020-09-24 22:51:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states.
[2020-09-24 22:51:54,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1611 transitions.
[2020-09-24 22:51:54,322 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1611 transitions. Word has length 163
[2020-09-24 22:51:54,322 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-09-24 22:51:54,322 INFO L479 AbstractCegarLoop]: Abstraction has 1347 states and 1611 transitions.
[2020-09-24 22:51:54,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-09-24 22:51:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1611 transitions.
[2020-09-24 22:51:54,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238
[2020-09-24 22:51:54,327 INFO L414 BasicCegarLoop]: Found error trace
[2020-09-24 22:51:54,328 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-09-24 22:51:54,328 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-09-24 22:51:54,328 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-09-24 22:51:54,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-09-24 22:51:54,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1776525167, now seen corresponding path program 1 times
[2020-09-24 22:51:54,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-09-24 22:51:54,329 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [79004527]
[2020-09-24 22:51:54,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-09-24 22:51:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-09-24 22:51:54,389 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace
[2020-09-24 22:51:54,390 INFO L520 BasicCegarLoop]: Counterexample might be feasible
[2020-09-24 22:51:54,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-09-24 22:51:54,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 10:51:54 BoogieIcfgContainer
[2020-09-24 22:51:54,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-09-24 22:51:54,459 INFO L168 Benchmark]: Toolchain (without parser) took 22716.56 ms. Allocated memory was 140.0 MB in the beginning and 457.2 MB in the end (delta: 317.2 MB). Free memory was 102.2 MB in the beginning and 201.7 MB in the end (delta: -99.5 MB). Peak memory consumption was 217.7 MB. Max. memory is 7.1 GB.
[2020-09-24 22:51:54,460 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
[2020-09-24 22:51:54,462 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.48 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 101.6 MB in the beginning and 171.0 MB in the end (delta: -69.4 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB.
[2020-09-24 22:51:54,469 INFO L168 Benchmark]: Boogie Preprocessor took 115.89 ms. Allocated memory is still 205.0 MB. Free memory was 171.0 MB in the beginning and 166.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB.
[2020-09-24 22:51:54,470 INFO L168 Benchmark]: RCFGBuilder took 1770.24 ms. Allocated memory was 205.0 MB in the beginning and 238.6 MB in the end (delta: 33.6 MB). Free memory was 166.0 MB in the beginning and 164.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 82.1 MB. Max. memory is 7.1 GB.
[2020-09-24 22:51:54,470 INFO L168 Benchmark]: TraceAbstraction took 20049.61 ms. Allocated memory was 238.6 MB in the beginning and 457.2 MB in the end (delta: 218.6 MB). Free memory was 164.3 MB in the beginning and 201.7 MB in the end (delta: -37.3 MB). Peak memory consumption was 181.3 MB. Max. memory is 7.1 GB.
[2020-09-24 22:51:54,483 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.27 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 769.48 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 101.6 MB in the beginning and 171.0 MB in the end (delta: -69.4 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 115.89 ms. Allocated memory is still 205.0 MB. Free memory was 171.0 MB in the beginning and 166.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 1770.24 ms. Allocated memory was 205.0 MB in the beginning and 238.6 MB in the end (delta: 33.6 MB). Free memory was 166.0 MB in the beginning and 164.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 82.1 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 20049.61 ms. Allocated memory was 238.6 MB in the beginning and 457.2 MB in the end (delta: 218.6 MB). Free memory was 164.3 MB in the beginning and 201.7 MB in the end (delta: -37.3 MB). Peak memory consumption was 181.3 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 55]: a call of __VERIFIER_error() is reachable
a call of __VERIFIER_error() is reachable
We found a FailurePath:
[L7] int inputC = 3;
[L8] int inputD = 4;
[L9] int inputE = 5;
[L10] int inputF = 6;
[L11] int inputB = 2;
[L14] int a1 = 23;
[L15] int a19 = 9;
[L16] int a10 = 0;
[L17] int a12 = 0;
[L18] int a4 = 14;
[L579] int output = -1;
[L582] COND TRUE 1
[L585] int input;
[L586] input = __VERIFIER_nondet_int()
[L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L590] CALL, EXPR calculate_output(input)
[L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
[L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
[L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
[L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
[L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
[L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
[L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
[L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
[L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
[L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
[L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
[L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
[L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
[L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
[L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
[L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
[L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
[L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
[L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
[L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
[L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
[L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
[L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
[L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
[L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
[L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
[L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
[L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
[L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
[L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
[L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
[L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
[L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
[L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
[L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
[L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
[L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
[L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
[L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
[L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
[L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
[L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
[L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
[L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
[L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
[L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
[L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
[L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
[L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
[L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
[L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
[L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
[L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
[L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
[L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
[L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
[L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
[L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
[L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
[L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9)))
[L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
[L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9)))
[L210] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))
[L211] a1 = (((a1 + -15535) - 211896) / 5)
[L212] a10 = 2
[L214] return 22;
[L590] RET, EXPR calculate_output(input)
[L590] output = calculate_output(input)
[L582] COND TRUE 1
[L585] int input;
[L586] input = __VERIFIER_nondet_int()
[L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L590] CALL, EXPR calculate_output(input)
[L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
[L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
[L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
[L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
[L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
[L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
[L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
[L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
[L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
[L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
[L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
[L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
[L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
[L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
[L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
[L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
[L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
[L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
[L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
[L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
[L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
[L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
[L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
[L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
[L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
[L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
[L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
[L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
[L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
[L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
[L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
[L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
[L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
[L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
[L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
[L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
[L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
[L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
[L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
[L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
[L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
[L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
[L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
[L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
[L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
[L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
[L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
[L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
[L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
[L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
[L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
[L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
[L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
[L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
[L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
[L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
[L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
[L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
[L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
[L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9)))
[L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
[L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9)))
[L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))))
[L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 ))
[L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14))))))
[L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0))))
[L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3)))))
[L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9))))
[L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1)))
[L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)))
[L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0))))
[L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)))
[L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0)))
[L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9)))
[L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0)))
[L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 )))))))
[L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14)))
[L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))))
[L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0)))
[L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14)))
[L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9)))
[L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)))
[L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0))))
[L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14)))
[L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2))))
[L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3)))
[L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1)))
[L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0)))
[L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9)))
[L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14)))))
[L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14)))
[L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14)))
[L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14)))))
[L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0)))
[L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)))))))
[L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0)))))
[L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10)))
[L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4))))
[L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9)))
[L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9)))
[L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0)))))
[L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14))))
[L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14))))
[L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14)))
[L408] COND TRUE ((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))
[L409] a1 = ((((a1 % 299890)+ 300108) * 1) * 1)
[L410] a10 = 0
[L411] a19 = 8
[L413] return -1;
[L590] RET, EXPR calculate_output(input)
[L590] output = calculate_output(input)
[L582] COND TRUE 1
[L585] int input;
[L586] input = __VERIFIER_nondet_int()
[L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L590] CALL calculate_output(input)
[L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
[L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
[L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
[L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
[L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
[L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
[L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
[L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
[L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
[L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
[L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
[L54] COND TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))
[L55] __VERIFIER_error()
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 456 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.8s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1051 SDtfs, 3463 SDslu, 942 SDs, 0 SdLazy, 5129 SolverSat, 860 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1347occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 655 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 838 NumberOfCodeBlocks, 838 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 596 ConstructedInterpolants, 0 QuantifiedInterpolants, 167313 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 77/80 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...