/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/geo3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:52:43,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:52:43,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:52:43,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:52:43,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:52:43,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:52:43,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:52:43,140 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:52:43,143 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:52:43,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:52:43,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:52:43,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:52:43,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:52:43,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:52:43,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:52:43,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:52:43,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:52:43,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:52:43,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:52:43,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:52:43,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:52:43,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:52:43,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:52:43,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:52:43,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:52:43,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:52:43,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:52:43,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:52:43,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:52:43,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:52:43,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:52:43,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:52:43,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:52:43,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:52:43,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:52:43,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:52:43,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:52:43,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:52:43,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:52:43,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:52:43,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:52:43,201 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:52:43,228 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:52:43,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:52:43,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:52:43,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:52:43,232 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:52:43,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:52:43,232 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:52:43,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:52:43,233 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:52:43,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:52:43,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:52:43,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:52:43,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:52:43,235 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:52:43,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:52:43,236 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:52:43,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:52:43,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:52:43,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:52:43,237 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:52:43,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:52:43,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:52:43,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:52:43,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:52:43,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:52:43,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:52:43,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:52:43,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:52:43,240 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:52:43,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:52:43,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:52:43,556 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:52:43,560 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:52:43,562 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:52:43,563 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:52:43,563 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/geo3.c [2020-07-17 22:52:43,661 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ebfab718/df29422c8cff44488b1476a0f308e442/FLAG1a6a0d269 [2020-07-17 22:52:44,130 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:52:44,130 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo3.c [2020-07-17 22:52:44,138 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ebfab718/df29422c8cff44488b1476a0f308e442/FLAG1a6a0d269 [2020-07-17 22:52:44,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ebfab718/df29422c8cff44488b1476a0f308e442 [2020-07-17 22:52:44,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:52:44,512 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:52:44,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:52:44,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:52:44,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:52:44,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5952304e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44, skipping insertion in model container [2020-07-17 22:52:44,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:52:44,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:52:44,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:52:44,739 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:52:44,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:52:44,775 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:52:44,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44 WrapperNode [2020-07-17 22:52:44,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:52:44,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:52:44,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:52:44,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:52:44,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:52:44,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:52:44,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:52:44,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:52:44,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/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-07-17 22:52:44,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:52:44,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:52:44,986 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:52:44,986 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:52:44,986 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:52:44,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:52:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:52:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:52:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:52:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:52:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:52:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:52:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:52:45,312 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:52:45,312 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:52:45,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:52:45 BoogieIcfgContainer [2020-07-17 22:52:45,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:52:45,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:52:45,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:52:45,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:52:45,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:52:44" (1/3) ... [2020-07-17 22:52:45,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3111265c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:52:45, skipping insertion in model container [2020-07-17 22:52:45,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44" (2/3) ... [2020-07-17 22:52:45,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3111265c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:52:45, skipping insertion in model container [2020-07-17 22:52:45,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:52:45" (3/3) ... [2020-07-17 22:52:45,324 INFO L109 eAbstractionObserver]: Analyzing ICFG geo3.c [2020-07-17 22:52:45,335 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:52:45,342 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:52:45,352 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:52:45,375 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:52:45,375 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:52:45,375 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:52:45,376 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:52:45,376 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:52:45,376 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:52:45,376 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:52:45,376 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:52:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-17 22:52:45,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:52:45,398 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:45,399 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:45,399 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:45,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:45,405 INFO L82 PathProgramCache]: Analyzing trace with hash -64610451, now seen corresponding path program 1 times [2020-07-17 22:52:45,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:45,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028498170] [2020-07-17 22:52:45,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:45,569 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-17 22:52:45,570 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2020-07-17 22:52:45,572 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-17 22:52:45,573 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-17 22:52:45,573 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2020-07-17 22:52:45,574 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2020-07-17 22:52:45,574 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1; {23#true} is VALID [2020-07-17 22:52:45,580 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#true} assume false; {24#false} is VALID [2020-07-17 22:52:45,580 INFO L263 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {24#false} is VALID [2020-07-17 22:52:45,581 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2020-07-17 22:52:45,581 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2020-07-17 22:52:45,582 INFO L280 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-17 22:52:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:45,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028498170] [2020-07-17 22:52:45,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:52:45,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-17 22:52:45,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898851612] [2020-07-17 22:52:45,593 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-17 22:52:45,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:45,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-17 22:52:45,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:45,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-17 22:52:45,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:45,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-17 22:52:45,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:52:45,669 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-17 22:52:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:45,742 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-07-17 22:52:45,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-17 22:52:45,743 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-17 22:52:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:52:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-17 22:52:45,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:52:45,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-17 22:52:45,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 45 transitions. [2020-07-17 22:52:45,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:45,884 INFO L225 Difference]: With dead ends: 35 [2020-07-17 22:52:45,884 INFO L226 Difference]: Without dead ends: 15 [2020-07-17 22:52:45,889 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:52:45,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-17 22:52:45,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-17 22:52:45,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:45,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:45,936 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:45,936 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:45,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:45,945 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-17 22:52:45,945 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-17 22:52:45,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:45,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:45,946 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:45,947 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:45,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:45,955 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-17 22:52:45,955 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-17 22:52:45,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:45,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:45,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:45,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:45,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:52:45,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-17 22:52:45,965 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-17 22:52:45,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:45,966 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-17 22:52:45,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-17 22:52:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-17 22:52:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:52:45,968 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:45,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:45,969 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:52:45,970 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:45,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:45,970 INFO L82 PathProgramCache]: Analyzing trace with hash -62822991, now seen corresponding path program 1 times [2020-07-17 22:52:45,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:45,973 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598074902] [2020-07-17 22:52:45,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:46,004 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:52:46,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [132392601] [2020-07-17 22:52:46,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:46,065 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:52:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:46,085 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:46,294 INFO L263 TraceCheckUtils]: 0: Hoare triple {129#true} call ULTIMATE.init(); {129#true} is VALID [2020-07-17 22:52:46,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {129#true} assume true; {129#true} is VALID [2020-07-17 22:52:46,295 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {129#true} {129#true} #46#return; {129#true} is VALID [2020-07-17 22:52:46,295 INFO L263 TraceCheckUtils]: 3: Hoare triple {129#true} call #t~ret3 := main(); {129#true} is VALID [2020-07-17 22:52:46,299 INFO L280 TraceCheckUtils]: 4: Hoare triple {129#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1; {146#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2020-07-17 22:52:46,303 INFO L280 TraceCheckUtils]: 5: Hoare triple {146#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {146#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2020-07-17 22:52:46,306 INFO L263 TraceCheckUtils]: 6: Hoare triple {146#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {153#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:52:46,308 INFO L280 TraceCheckUtils]: 7: Hoare triple {153#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {157#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:46,309 INFO L280 TraceCheckUtils]: 8: Hoare triple {157#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {130#false} is VALID [2020-07-17 22:52:46,309 INFO L280 TraceCheckUtils]: 9: Hoare triple {130#false} assume !false; {130#false} is VALID [2020-07-17 22:52:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:46,314 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598074902] [2020-07-17 22:52:46,314 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:52:46,314 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132392601] [2020-07-17 22:52:46,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:52:46,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:52:46,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365730828] [2020-07-17 22:52:46,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-17 22:52:46,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:46,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:52:46,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:46,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:52:46,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:46,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:52:46,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:52:46,344 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2020-07-17 22:52:46,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:46,575 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-17 22:52:46,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:52:46,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-17 22:52:46,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:52:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-17 22:52:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:52:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-17 22:52:46,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2020-07-17 22:52:46,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:46,627 INFO L225 Difference]: With dead ends: 25 [2020-07-17 22:52:46,627 INFO L226 Difference]: Without dead ends: 22 [2020-07-17 22:52:46,628 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:52:46,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-17 22:52:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-17 22:52:46,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:46,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-17 22:52:46,643 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-17 22:52:46,644 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-17 22:52:46,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:46,646 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-17 22:52:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-17 22:52:46,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:46,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:46,648 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-17 22:52:46,648 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-17 22:52:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:46,650 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-17 22:52:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-17 22:52:46,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:46,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:46,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:46,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:46,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-17 22:52:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-17 22:52:46,654 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2020-07-17 22:52:46,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:46,655 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-17 22:52:46,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:52:46,655 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-17 22:52:46,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:52:46,656 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:46,657 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:46,857 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:52:46,859 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:46,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:46,860 INFO L82 PathProgramCache]: Analyzing trace with hash 50868238, now seen corresponding path program 1 times [2020-07-17 22:52:46,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:46,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088306387] [2020-07-17 22:52:46,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:46,870 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:52:46,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1092494482] [2020-07-17 22:52:46,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:46,902 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-17 22:52:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-17 22:52:48,942 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:49,154 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-17 22:52:49,155 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-17 22:52:49,155 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #46#return; {279#true} is VALID [2020-07-17 22:52:49,156 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret3 := main(); {279#true} is VALID [2020-07-17 22:52:49,157 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1; {296#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2020-07-17 22:52:49,158 INFO L280 TraceCheckUtils]: 5: Hoare triple {296#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {296#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2020-07-17 22:52:49,159 INFO L263 TraceCheckUtils]: 6: Hoare triple {296#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {279#true} is VALID [2020-07-17 22:52:49,160 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} ~cond := #in~cond; {306#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:49,161 INFO L280 TraceCheckUtils]: 8: Hoare triple {306#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {310#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:52:49,162 INFO L280 TraceCheckUtils]: 9: Hoare triple {310#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {310#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:52:49,163 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {310#(not (= 0 |__VERIFIER_assert_#in~cond|))} {296#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} #50#return; {296#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2020-07-17 22:52:49,166 INFO L280 TraceCheckUtils]: 11: Hoare triple {296#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {320#(and (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} is VALID [2020-07-17 22:52:49,168 INFO L280 TraceCheckUtils]: 12: Hoare triple {320#(and (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} assume !false; {320#(and (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} is VALID [2020-07-17 22:52:51,204 INFO L263 TraceCheckUtils]: 13: Hoare triple {320#(and (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {327#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2020-07-17 22:52:51,206 INFO L280 TraceCheckUtils]: 14: Hoare triple {327#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {331#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:51,207 INFO L280 TraceCheckUtils]: 15: Hoare triple {331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {280#false} is VALID [2020-07-17 22:52:51,208 INFO L280 TraceCheckUtils]: 16: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-17 22:52:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:51,211 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088306387] [2020-07-17 22:52:51,211 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:52:51,211 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092494482] [2020-07-17 22:52:51,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:52:51,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 22:52:51,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362036655] [2020-07-17 22:52:51,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-07-17 22:52:51,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:51,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:52:53,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:53,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:52:53,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:53,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:52:53,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:52:53,316 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2020-07-17 22:53:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:05,732 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-17 22:53:05,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:53:05,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-07-17 22:53:05,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:53:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:53:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2020-07-17 22:53:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:53:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2020-07-17 22:53:05,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2020-07-17 22:53:07,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:07,853 INFO L225 Difference]: With dead ends: 32 [2020-07-17 22:53:07,853 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:53:07,854 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:53:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:53:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-17 22:53:07,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:53:07,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2020-07-17 22:53:07,880 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2020-07-17 22:53:07,880 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2020-07-17 22:53:07,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:07,883 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-17 22:53:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-17 22:53:07,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:07,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:07,885 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2020-07-17 22:53:07,885 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2020-07-17 22:53:07,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:07,888 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-17 22:53:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-17 22:53:07,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:07,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:07,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:53:07,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:53:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 22:53:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-17 22:53:07,893 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 17 [2020-07-17 22:53:07,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:53:07,893 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-17 22:53:07,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:53:07,894 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-17 22:53:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:53:07,894 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:53:07,895 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:53:08,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:53:08,096 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:53:08,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:53:08,097 INFO L82 PathProgramCache]: Analyzing trace with hash 325764102, now seen corresponding path program 1 times [2020-07-17 22:53:08,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:53:08,098 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564929716] [2020-07-17 22:53:08,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:53:08,110 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:53:08,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789968763] [2020-07-17 22:53:08,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:53:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:53:08,139 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-17 22:53:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:53:08,152 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:53:10,366 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:53:10,568 INFO L263 TraceCheckUtils]: 0: Hoare triple {490#true} call ULTIMATE.init(); {490#true} is VALID [2020-07-17 22:53:10,568 INFO L280 TraceCheckUtils]: 1: Hoare triple {490#true} assume true; {490#true} is VALID [2020-07-17 22:53:10,569 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {490#true} {490#true} #46#return; {490#true} is VALID [2020-07-17 22:53:10,569 INFO L263 TraceCheckUtils]: 3: Hoare triple {490#true} call #t~ret3 := main(); {490#true} is VALID [2020-07-17 22:53:10,570 INFO L280 TraceCheckUtils]: 4: Hoare triple {490#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1; {490#true} is VALID [2020-07-17 22:53:10,570 INFO L280 TraceCheckUtils]: 5: Hoare triple {490#true} assume !false; {490#true} is VALID [2020-07-17 22:53:10,570 INFO L263 TraceCheckUtils]: 6: Hoare triple {490#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {490#true} is VALID [2020-07-17 22:53:10,571 INFO L280 TraceCheckUtils]: 7: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2020-07-17 22:53:10,571 INFO L280 TraceCheckUtils]: 8: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2020-07-17 22:53:10,571 INFO L280 TraceCheckUtils]: 9: Hoare triple {490#true} assume true; {490#true} is VALID [2020-07-17 22:53:10,572 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {490#true} {490#true} #50#return; {490#true} is VALID [2020-07-17 22:53:10,572 INFO L280 TraceCheckUtils]: 11: Hoare triple {490#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {490#true} is VALID [2020-07-17 22:53:10,572 INFO L280 TraceCheckUtils]: 12: Hoare triple {490#true} assume !false; {490#true} is VALID [2020-07-17 22:53:10,572 INFO L263 TraceCheckUtils]: 13: Hoare triple {490#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {490#true} is VALID [2020-07-17 22:53:10,575 INFO L280 TraceCheckUtils]: 14: Hoare triple {490#true} ~cond := #in~cond; {537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:53:10,576 INFO L280 TraceCheckUtils]: 15: Hoare triple {537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {541#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:53:10,577 INFO L280 TraceCheckUtils]: 16: Hoare triple {541#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {541#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:53:10,578 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {541#(not (= 0 |__VERIFIER_assert_#in~cond|))} {490#true} #50#return; {548#(= (+ (* main_~x~0 main_~z~0) main_~a~0) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0)))} is VALID [2020-07-17 22:53:10,584 INFO L280 TraceCheckUtils]: 18: Hoare triple {548#(= (+ (* main_~x~0 main_~z~0) main_~a~0) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0)))} assume !(~c~0 < ~k~0); {548#(= (+ (* main_~x~0 main_~z~0) main_~a~0) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0)))} is VALID [2020-07-17 22:53:10,585 INFO L263 TraceCheckUtils]: 19: Hoare triple {548#(= (+ (* main_~x~0 main_~z~0) main_~a~0) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0)))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {555#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:53:10,586 INFO L280 TraceCheckUtils]: 20: Hoare triple {555#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {559#(= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:53:10,592 INFO L280 TraceCheckUtils]: 21: Hoare triple {559#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {491#false} is VALID [2020-07-17 22:53:10,592 INFO L280 TraceCheckUtils]: 22: Hoare triple {491#false} assume !false; {491#false} is VALID [2020-07-17 22:53:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-17 22:53:10,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564929716] [2020-07-17 22:53:10,594 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:53:10,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789968763] [2020-07-17 22:53:10,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:53:10,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 22:53:10,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342118761] [2020-07-17 22:53:10,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-17 22:53:10,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:53:10,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:53:10,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:10,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:53:10,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:53:10,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:53:10,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=29, Unknown=1, NotChecked=0, Total=42 [2020-07-17 22:53:10,639 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-07-17 22:53:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:15,733 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-17 22:53:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:53:15,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-17 22:53:15,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:53:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:53:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2020-07-17 22:53:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:53:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2020-07-17 22:53:15,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 24 transitions. [2020-07-17 22:53:15,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:15,790 INFO L225 Difference]: With dead ends: 34 [2020-07-17 22:53:15,791 INFO L226 Difference]: Without dead ends: 27 [2020-07-17 22:53:15,792 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=23, Invalid=48, Unknown=1, NotChecked=0, Total=72 [2020-07-17 22:53:15,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-17 22:53:15,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-17 22:53:15,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:53:15,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-17 22:53:15,813 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-17 22:53:15,813 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-17 22:53:15,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:15,816 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-17 22:53:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-17 22:53:15,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:15,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:15,817 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-17 22:53:15,817 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-17 22:53:15,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:15,820 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-17 22:53:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-17 22:53:15,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:15,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:15,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:53:15,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:53:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-17 22:53:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-17 22:53:15,823 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2020-07-17 22:53:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:53:15,824 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-17 22:53:15,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:53:15,824 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-17 22:53:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:53:15,825 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:53:15,825 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:53:16,038 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:53:16,040 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:53:16,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:53:16,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1538749201, now seen corresponding path program 2 times [2020-07-17 22:53:16,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:53:16,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282879738] [2020-07-17 22:53:16,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:53:16,048 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:53:16,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1692381427] [2020-07-17 22:53:16,049 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:53:16,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:53:16,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:53:16,113 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 29 conjunts are in the unsatisfiable core [2020-07-17 22:53:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-17 22:53:18,172 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:53:22,533 WARN L193 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 14 [2020-07-17 22:53:22,795 INFO L263 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {712#true} is VALID [2020-07-17 22:53:22,795 INFO L280 TraceCheckUtils]: 1: Hoare triple {712#true} assume true; {712#true} is VALID [2020-07-17 22:53:22,796 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {712#true} {712#true} #46#return; {712#true} is VALID [2020-07-17 22:53:22,796 INFO L263 TraceCheckUtils]: 3: Hoare triple {712#true} call #t~ret3 := main(); {712#true} is VALID [2020-07-17 22:53:22,798 INFO L280 TraceCheckUtils]: 4: Hoare triple {712#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1; {729#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2020-07-17 22:53:22,799 INFO L280 TraceCheckUtils]: 5: Hoare triple {729#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {729#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2020-07-17 22:53:22,799 INFO L263 TraceCheckUtils]: 6: Hoare triple {729#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {712#true} is VALID [2020-07-17 22:53:22,800 INFO L280 TraceCheckUtils]: 7: Hoare triple {712#true} ~cond := #in~cond; {739#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:53:22,801 INFO L280 TraceCheckUtils]: 8: Hoare triple {739#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {743#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:53:22,801 INFO L280 TraceCheckUtils]: 9: Hoare triple {743#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {743#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:53:22,803 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {743#(not (= 0 |__VERIFIER_assert_#in~cond|))} {729#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} #50#return; {729#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2020-07-17 22:53:22,810 INFO L280 TraceCheckUtils]: 11: Hoare triple {729#(and (= 1 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {753#(and (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} is VALID [2020-07-17 22:53:22,812 INFO L280 TraceCheckUtils]: 12: Hoare triple {753#(and (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} assume !false; {753#(and (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} is VALID [2020-07-17 22:53:22,812 INFO L263 TraceCheckUtils]: 13: Hoare triple {753#(and (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {712#true} is VALID [2020-07-17 22:53:22,813 INFO L280 TraceCheckUtils]: 14: Hoare triple {712#true} ~cond := #in~cond; {739#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:53:22,814 INFO L280 TraceCheckUtils]: 15: Hoare triple {739#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {743#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:53:22,814 INFO L280 TraceCheckUtils]: 16: Hoare triple {743#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {743#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:53:22,816 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {743#(not (= 0 |__VERIFIER_assert_#in~cond|))} {753#(and (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} #50#return; {772#(and (= (+ (* main_~x~0 main_~z~0) main_~a~0) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0))) (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} is VALID [2020-07-17 22:53:22,825 INFO L280 TraceCheckUtils]: 18: Hoare triple {772#(and (= (+ (* main_~x~0 main_~z~0) main_~a~0) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0))) (= (+ (* main_~z~0 main_~a~0) main_~a~0) main_~x~0) (= main_~z~0 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {776#(and (= main_~x~0 (+ (* main_~z~0 main_~z~0 main_~a~0) (* main_~z~0 main_~a~0) main_~a~0)) (= main_~y~0 (* main_~z~0 main_~z~0)))} is VALID [2020-07-17 22:53:22,826 INFO L280 TraceCheckUtils]: 19: Hoare triple {776#(and (= main_~x~0 (+ (* main_~z~0 main_~z~0 main_~a~0) (* main_~z~0 main_~a~0) main_~a~0)) (= main_~y~0 (* main_~z~0 main_~z~0)))} assume !false; {776#(and (= main_~x~0 (+ (* main_~z~0 main_~z~0 main_~a~0) (* main_~z~0 main_~a~0) main_~a~0)) (= main_~y~0 (* main_~z~0 main_~z~0)))} is VALID [2020-07-17 22:53:24,880 INFO L263 TraceCheckUtils]: 20: Hoare triple {776#(and (= main_~x~0 (+ (* main_~z~0 main_~z~0 main_~a~0) (* main_~z~0 main_~a~0) main_~a~0)) (= main_~y~0 (* main_~z~0 main_~z~0)))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {783#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2020-07-17 22:53:24,881 INFO L280 TraceCheckUtils]: 21: Hoare triple {783#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {787#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:53:24,882 INFO L280 TraceCheckUtils]: 22: Hoare triple {787#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {713#false} is VALID [2020-07-17 22:53:24,882 INFO L280 TraceCheckUtils]: 23: Hoare triple {713#false} assume !false; {713#false} is VALID [2020-07-17 22:53:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 22:53:24,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282879738] [2020-07-17 22:53:24,884 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:53:24,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692381427] [2020-07-17 22:53:24,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:53:24,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 22:53:24,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317441952] [2020-07-17 22:53:24,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-17 22:53:24,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:53:24,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:53:26,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 20 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:26,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:53:26,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:53:26,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:53:26,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2020-07-17 22:53:26,990 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 10 states. [2020-07-17 22:53:48,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:48,494 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-17 22:53:48,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:53:48,494 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-17 22:53:48,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:53:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:53:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-17 22:53:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:53:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-17 22:53:48,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 31 transitions. [2020-07-17 22:53:50,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:50,633 INFO L225 Difference]: With dead ends: 37 [2020-07-17 22:53:50,633 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:53:50,634 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=30, Invalid=101, Unknown=1, NotChecked=0, Total=132 [2020-07-17 22:53:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:53:50,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-17 22:53:50,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:53:50,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2020-07-17 22:53:50,655 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2020-07-17 22:53:50,656 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2020-07-17 22:53:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:50,658 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-17 22:53:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-17 22:53:50,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:50,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:50,659 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2020-07-17 22:53:50,659 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2020-07-17 22:53:50,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:50,662 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-17 22:53:50,662 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-17 22:53:50,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:50,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:50,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:53:50,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:53:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-17 22:53:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2020-07-17 22:53:50,665 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2020-07-17 22:53:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:53:50,665 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2020-07-17 22:53:50,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:53:50,666 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-17 22:53:50,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:53:50,667 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:53:50,667 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:53:50,875 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:53:50,876 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:53:50,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:53:50,877 INFO L82 PathProgramCache]: Analyzing trace with hash -695576914, now seen corresponding path program 3 times [2020-07-17 22:53:50,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:53:50,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057029353] [2020-07-17 22:53:50,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:53:50,885 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:53:50,885 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1346243504] [2020-07-17 22:53:50,885 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:53:50,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-17 22:53:50,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:53:50,928 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-17 22:53:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-17 22:53:52,958 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:53:59,275 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:54:21,671 WARN L193 SmtUtils]: Spent 11.17 s on a formula simplification that was a NOOP. DAG size: 26 [2020-07-17 22:54:21,696 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:54:50,349 WARN L193 SmtUtils]: Spent 13.46 s on a formula simplification that was a NOOP. DAG size: 26 [2020-07-17 22:54:52,441 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:55:00,761 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) v_main_~x~0_14)))) is different from false [2020-07-17 22:55:02,779 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) v_main_~x~0_14)))) is different from true [2020-07-17 22:55:02,780 INFO L263 TraceCheckUtils]: 0: Hoare triple {970#true} call ULTIMATE.init(); {970#true} is VALID [2020-07-17 22:55:02,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {970#true} assume true; {970#true} is VALID [2020-07-17 22:55:02,780 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {970#true} {970#true} #46#return; {970#true} is VALID [2020-07-17 22:55:02,781 INFO L263 TraceCheckUtils]: 3: Hoare triple {970#true} call #t~ret3 := main(); {970#true} is VALID [2020-07-17 22:55:02,781 INFO L280 TraceCheckUtils]: 4: Hoare triple {970#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1; {970#true} is VALID [2020-07-17 22:55:02,781 INFO L280 TraceCheckUtils]: 5: Hoare triple {970#true} assume !false; {970#true} is VALID [2020-07-17 22:55:02,781 INFO L263 TraceCheckUtils]: 6: Hoare triple {970#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {970#true} is VALID [2020-07-17 22:55:02,782 INFO L280 TraceCheckUtils]: 7: Hoare triple {970#true} ~cond := #in~cond; {970#true} is VALID [2020-07-17 22:55:02,782 INFO L280 TraceCheckUtils]: 8: Hoare triple {970#true} assume !(0 == ~cond); {970#true} is VALID [2020-07-17 22:55:02,782 INFO L280 TraceCheckUtils]: 9: Hoare triple {970#true} assume true; {970#true} is VALID [2020-07-17 22:55:02,782 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {970#true} {970#true} #50#return; {970#true} is VALID [2020-07-17 22:55:02,783 INFO L280 TraceCheckUtils]: 11: Hoare triple {970#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {970#true} is VALID [2020-07-17 22:55:02,783 INFO L280 TraceCheckUtils]: 12: Hoare triple {970#true} assume !false; {970#true} is VALID [2020-07-17 22:55:02,783 INFO L263 TraceCheckUtils]: 13: Hoare triple {970#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {970#true} is VALID [2020-07-17 22:55:02,784 INFO L280 TraceCheckUtils]: 14: Hoare triple {970#true} ~cond := #in~cond; {970#true} is VALID [2020-07-17 22:55:02,784 INFO L280 TraceCheckUtils]: 15: Hoare triple {970#true} assume !(0 == ~cond); {970#true} is VALID [2020-07-17 22:55:02,784 INFO L280 TraceCheckUtils]: 16: Hoare triple {970#true} assume true; {970#true} is VALID [2020-07-17 22:55:02,784 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {970#true} {970#true} #50#return; {970#true} is VALID [2020-07-17 22:55:02,785 INFO L280 TraceCheckUtils]: 18: Hoare triple {970#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {970#true} is VALID [2020-07-17 22:55:02,785 INFO L280 TraceCheckUtils]: 19: Hoare triple {970#true} assume !false; {970#true} is VALID [2020-07-17 22:55:02,785 INFO L263 TraceCheckUtils]: 20: Hoare triple {970#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {970#true} is VALID [2020-07-17 22:55:02,792 INFO L280 TraceCheckUtils]: 21: Hoare triple {970#true} ~cond := #in~cond; {1038#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:55:02,794 INFO L280 TraceCheckUtils]: 22: Hoare triple {1038#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1042#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:55:02,795 INFO L280 TraceCheckUtils]: 23: Hoare triple {1042#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {1042#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:55:02,796 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1042#(not (= 0 |__VERIFIER_assert_#in~cond|))} {970#true} #50#return; {1049#(= (+ (* main_~x~0 main_~z~0) main_~a~0) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0)))} is VALID [2020-07-17 22:55:02,991 INFO L280 TraceCheckUtils]: 25: Hoare triple {1049#(= (+ (* main_~x~0 main_~z~0) main_~a~0) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1053#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_14 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= (+ (* main_~z~0 v_main_~y~0_13 main_~a~0) v_main_~x~0_14) (+ (* main_~z~0 v_main_~x~0_14) main_~a~0)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_14) main_~a~0))))} is VALID [2020-07-17 22:55:02,992 INFO L280 TraceCheckUtils]: 26: Hoare triple {1053#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_14 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= (+ (* main_~z~0 v_main_~y~0_13 main_~a~0) v_main_~x~0_14) (+ (* main_~z~0 v_main_~x~0_14) main_~a~0)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_14) main_~a~0))))} assume !false; {1053#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_14 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= (+ (* main_~z~0 v_main_~y~0_13 main_~a~0) v_main_~x~0_14) (+ (* main_~z~0 v_main_~x~0_14) main_~a~0)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_14) main_~a~0))))} is VALID [2020-07-17 22:55:05,049 INFO L263 TraceCheckUtils]: 27: Hoare triple {1053#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_14 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= (+ (* main_~z~0 v_main_~y~0_13 main_~a~0) v_main_~x~0_14) (+ (* main_~z~0 v_main_~x~0_14) main_~a~0)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_14) main_~a~0))))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~a~0 * ~z~0 * ~y~0 then 1 else 0)); {1060#(or (<= 1 |__VERIFIER_assert_#in~cond|) (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) v_main_~x~0_14))))))} is UNKNOWN [2020-07-17 22:55:05,051 INFO L280 TraceCheckUtils]: 28: Hoare triple {1060#(or (<= 1 |__VERIFIER_assert_#in~cond|) (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) v_main_~x~0_14))))))} ~cond := #in~cond; {1064#(or (<= 1 __VERIFIER_assert_~cond) (and (<= 0 __VERIFIER_assert_~cond) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) v_main_~x~0_14))))))} is VALID [2020-07-17 22:55:05,052 INFO L280 TraceCheckUtils]: 29: Hoare triple {1064#(or (<= 1 __VERIFIER_assert_~cond) (and (<= 0 __VERIFIER_assert_~cond) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) v_main_~x~0_14))))))} assume 0 == ~cond; {1068#(exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) v_main_~x~0_14))))} is VALID [2020-07-17 22:55:07,079 INFO L280 TraceCheckUtils]: 30: Hoare triple {1068#(exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) v_main_~x~0_14))))} assume !false; {971#false} is UNKNOWN [2020-07-17 22:55:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 1 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-17 22:55:07,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057029353] [2020-07-17 22:55:07,083 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:55:07,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346243504] [2020-07-17 22:55:07,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:55:07,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 22:55:07,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113061302] [2020-07-17 22:55:07,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-07-17 22:55:07,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:55:07,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:55:17,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 17 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2020-07-17 22:55:17,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:55:17,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:55:17,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:55:17,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=38, Unknown=7, NotChecked=12, Total=72 [2020-07-17 22:55:17,409 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 9 states. [2020-07-17 22:55:40,272 WARN L193 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 29 DAG size of output: 3 [2020-07-17 22:55:50,899 WARN L193 SmtUtils]: Spent 8.48 s on a formula simplification. DAG size of input: 35 DAG size of output: 6 [2020-07-17 22:56:28,940 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8) v_main_~x~0_14)))))) (and (or (<= 1 |c___VERIFIER_assert_#in~cond|) (and (<= 0 |c___VERIFIER_assert_#in~cond|) .cse0)) (or (<= 1 c___VERIFIER_assert_~cond) (and (<= 0 c___VERIFIER_assert_~cond) .cse0)) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond))) is different from false [2020-07-17 22:56:45,211 WARN L193 SmtUtils]: Spent 5.91 s on a formula simplification that was a NOOP. DAG size: 22 [2020-07-17 22:56:59,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:56:59,832 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-17 22:56:59,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:56:59,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-07-17 22:56:59,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:56:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:56:59,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2020-07-17 22:56:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:56:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2020-07-17 22:56:59,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 21 transitions. [2020-07-17 22:57:08,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 17 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2020-07-17 22:57:08,152 INFO L225 Difference]: With dead ends: 34 [2020-07-17 22:57:08,152 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:57:08,153 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 75.7s TimeCoverageRelationStatistics Valid=32, Invalid=75, Unknown=11, NotChecked=38, Total=156 [2020-07-17 22:57:08,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:57:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:57:08,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:57:08,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:57:08,154 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:57:08,154 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:57:08,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:57:08,154 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:57:08,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:57:08,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:57:08,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:57:08,155 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:57:08,155 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:57:08,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:57:08,155 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:57:08,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:57:08,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:57:08,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:57:08,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:57:08,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:57:08,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:57:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:57:08,156 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2020-07-17 22:57:08,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:57:08,156 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:57:08,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:57:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:57:08,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:57:08,364 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-17 22:57:08,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:57:08,651 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2020-07-17 22:57:09,655 WARN L193 SmtUtils]: Spent 997.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2020-07-17 22:58:07,214 WARN L193 SmtUtils]: Spent 55.50 s on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2020-07-17 22:58:08,268 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2020-07-17 22:58:08,274 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:58:08,274 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:58:08,274 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:58:08,274 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:58:08,274 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:58:08,275 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:58:08,275 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 9 11) no Hoare annotation was computed. [2020-07-17 22:58:08,275 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-17 22:58:08,275 INFO L268 CegarLoopResult]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2020-07-17 22:58:08,275 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2020-07-17 22:58:08,275 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (or (exists ((v_main_~y~0_13 Int) (v_main_~x~0_14 Int)) (let ((.cse0 (+ (* main_~z~0 v_main_~x~0_14) main_~a~0))) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= (+ (* main_~z~0 v_main_~y~0_13 main_~a~0) v_main_~x~0_14) .cse0) (= main_~x~0 .cse0)))) (and (= 1 main_~y~0) (= main_~a~0 main_~x~0))) [2020-07-17 22:58:08,275 INFO L268 CegarLoopResult]: For program point L31-1(lines 30 39) no Hoare annotation was computed. [2020-07-17 22:58:08,275 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 19 42) the Hoare annotation is: true [2020-07-17 22:58:08,276 INFO L264 CegarLoopResult]: At program point L30-2(lines 30 39) the Hoare annotation is: (or (exists ((v_main_~y~0_13 Int) (v_main_~x~0_14 Int)) (let ((.cse0 (+ (* main_~z~0 v_main_~x~0_14) main_~a~0))) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= (+ (* main_~z~0 v_main_~y~0_13 main_~a~0) v_main_~x~0_14) .cse0) (= main_~x~0 .cse0)))) (and (= 1 main_~y~0) (= main_~a~0 main_~x~0))) [2020-07-17 22:58:08,276 INFO L264 CegarLoopResult]: At program point L30-3(lines 30 39) the Hoare annotation is: (= (+ main_~a~0 (* main_~x~0 main_~z~0)) (+ main_~x~0 (* main_~y~0 main_~z~0 main_~a~0))) [2020-07-17 22:58:08,276 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 19 42) no Hoare annotation was computed. [2020-07-17 22:58:08,276 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 19 42) no Hoare annotation was computed. [2020-07-17 22:58:08,276 INFO L268 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2020-07-17 22:58:08,276 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 12 18) the Hoare annotation is: (or (forall ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (or (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8))) (not (= (+ v_main_~x~0_14 (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8))))) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_BEFORE_CALL_8 Int) (v_main_~x~0_14 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)))) (= (+ v_main_~x~0_14 (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_BEFORE_CALL_8)) (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_14) v_main_~x~0_BEFORE_CALL_8)))) (<= 1 |__VERIFIER_assert_#in~cond|) (not (<= 0 |__VERIFIER_assert_#in~cond|))) [2020-07-17 22:58:08,276 INFO L268 CegarLoopResult]: For program point L14(lines 14 15) no Hoare annotation was computed. [2020-07-17 22:58:08,277 INFO L268 CegarLoopResult]: For program point L13(lines 13 16) no Hoare annotation was computed. [2020-07-17 22:58:08,277 INFO L268 CegarLoopResult]: For program point L13-2(lines 12 18) no Hoare annotation was computed. [2020-07-17 22:58:08,277 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 12 18) no Hoare annotation was computed. [2020-07-17 22:58:08,277 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2020-07-17 22:58:08,282 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:58:08,282 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:58:08,284 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:58:08,284 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:58:08,284 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:58:08,284 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-17 22:58:08,284 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-17 22:58:08,293 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:58:08,294 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:58:08,294 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:58:08,294 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2020-07-17 22:58:08,294 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-17 22:58:08,299 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-17 22:58:10,429 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:58:10,429 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:58:10,429 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-17 22:58:10,429 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-17 22:58:10,429 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-17 22:58:10,430 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-17 22:58:10,430 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:58:10,430 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:58:10,430 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:58:10,430 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:58:10,430 INFO L163 areAnnotationChecker]: CFG has 8 edges. 7 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:58:10,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-17 22:58:10,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-17 22:58:10,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-17 22:58:10,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-17 22:58:10,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-17 22:58:10,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-17 22:58:10,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-17 22:58:10,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-17 22:58:10,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-17 22:58:10,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-17 22:58:10,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:58:10 BoogieIcfgContainer [2020-07-17 22:58:10,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:58:10,451 INFO L168 Benchmark]: Toolchain (without parser) took 325939.61 ms. Allocated memory was 145.8 MB in the beginning and 263.7 MB in the end (delta: 118.0 MB). Free memory was 104.4 MB in the beginning and 154.0 MB in the end (delta: -49.6 MB). Peak memory consumption was 68.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:58:10,452 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:58:10,452 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.37 ms. Allocated memory is still 145.8 MB. Free memory was 104.2 MB in the beginning and 93.7 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:58:10,453 INFO L168 Benchmark]: Boogie Preprocessor took 137.86 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 93.7 MB in the beginning and 184.0 MB in the end (delta: -90.3 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:58:10,454 INFO L168 Benchmark]: RCFGBuilder took 400.23 ms. Allocated memory is still 203.9 MB. Free memory was 184.0 MB in the beginning and 165.7 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:58:10,455 INFO L168 Benchmark]: TraceAbstraction took 325131.09 ms. Allocated memory was 203.9 MB in the beginning and 263.7 MB in the end (delta: 59.8 MB). Free memory was 165.7 MB in the beginning and 154.0 MB in the end (delta: 11.7 MB). Peak memory consumption was 71.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:58:10,459 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 263.37 ms. Allocated memory is still 145.8 MB. Free memory was 104.2 MB in the beginning and 93.7 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 137.86 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 93.7 MB in the beginning and 184.0 MB in the end (delta: -90.3 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 400.23 ms. Allocated memory is still 203.9 MB. Free memory was 184.0 MB in the beginning and 165.7 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 325131.09 ms. Allocated memory was 203.9 MB in the beginning and 263.7 MB in the end (delta: 59.8 MB). Free memory was 165.7 MB in the beginning and 154.0 MB in the end (delta: 11.7 MB). Peak memory consumption was 71.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant [2020-07-17 22:58:10,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-17 22:58:10,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-17 22:58:10,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-17 22:58:10,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-17 22:58:10,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-17 22:58:10,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-17 22:58:10,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-17 22:58:10,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-17 22:58:10,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2020-07-17 22:58:10,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] Derived loop invariant: (\exists v_main_~y~0_13 : int, v_main_~x~0_14 : int :: (y == z * v_main_~y~0_13 && z * v_main_~y~0_13 * a + v_main_~x~0_14 == z * v_main_~x~0_14 + a) && x == z * v_main_~x~0_14 + a) || (1 == y && a == x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 262.9s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 154.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 59.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 81 SDtfs, 53 SDslu, 244 SDs, 0 SdLazy, 195 SolverSat, 11 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 33.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 82.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred 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.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 15 PreInvPairs, 25 NumberOfFragments, 166 HoareAnnotationTreeSize, 15 FomulaSimplifications, 252 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 42 FormulaSimplificationTreeSizeReductionInter, 57.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 92.0s InterpolantComputationTime, 115 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 109 ConstructedInterpolants, 5 QuantifiedInterpolants, 12389 SizeOfPredicates, 16 NumberOfNonLiveVariables, 285 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 49/63 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 correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...