/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/geo2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:48:12,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:48:12,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:48:12,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:48:12,990 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:48:12,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:48:12,995 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:48:13,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:48:13,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:48:13,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:48:13,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:48:13,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:48:13,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:48:13,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:48:13,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:48:13,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:48:13,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:48:13,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:48:13,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:48:13,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:48:13,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:48:13,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:48:13,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:48:13,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:48:13,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:48:13,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:48:13,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:48:13,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:48:13,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:48:13,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:48:13,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:48:13,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:48:13,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:48:13,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:48:13,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:48:13,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:48:13,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:48:13,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:48:13,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:48:13,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:48:13,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:48:13,065 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-08 12:48:13,090 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:48:13,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:48:13,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:48:13,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:48:13,093 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:48:13,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:48:13,093 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:48:13,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:48:13,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:48:13,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:48:13,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:48:13,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:48:13,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:48:13,096 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:48:13,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:48:13,096 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:48:13,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:48:13,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:48:13,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:48:13,097 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:48:13,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:48:13,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:48:13,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:48:13,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:48:13,098 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:48:13,098 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:48:13,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:48:13,099 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:48:13,099 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:48:13,099 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:48:13,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:48:13,453 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:48:13,457 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:48:13,458 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:48:13,459 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:48:13,459 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/geo2.c [2020-07-08 12:48:13,550 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e4aea3d/5ee5db70f6dd4f19b9e7c9faedd4e353/FLAGa848a7863 [2020-07-08 12:48:14,027 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:48:14,028 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo2.c [2020-07-08 12:48:14,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e4aea3d/5ee5db70f6dd4f19b9e7c9faedd4e353/FLAGa848a7863 [2020-07-08 12:48:14,397 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e4aea3d/5ee5db70f6dd4f19b9e7c9faedd4e353 [2020-07-08 12:48:14,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:48:14,413 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:48:14,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:48:14,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:48:14,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:48:14,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@980e4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14, skipping insertion in model container [2020-07-08 12:48:14,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:48:14,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:48:14,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:48:14,649 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:48:14,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:48:14,689 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:48:14,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14 WrapperNode [2020-07-08 12:48:14,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:48:14,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:48:14,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:48:14,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:48:14,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:48:14,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:48:14,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:48:14,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:48:14,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (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-08 12:48:14,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:48:14,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:48:14,896 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:48:14,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:48:14,896 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:48:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:48:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:48:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:48:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:48:14,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:48:14,897 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:48:14,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:48:14,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:48:15,152 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:48:15,153 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 12:48:15,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:48:15 BoogieIcfgContainer [2020-07-08 12:48:15,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:48:15,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:48:15,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:48:15,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:48:15,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:48:14" (1/3) ... [2020-07-08 12:48:15,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9e2212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:48:15, skipping insertion in model container [2020-07-08 12:48:15,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (2/3) ... [2020-07-08 12:48:15,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9e2212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:48:15, skipping insertion in model container [2020-07-08 12:48:15,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:48:15" (3/3) ... [2020-07-08 12:48:15,174 INFO L109 eAbstractionObserver]: Analyzing ICFG geo2.c [2020-07-08 12:48:15,189 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:48:15,198 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:48:15,225 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:48:15,274 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:48:15,274 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:48:15,274 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:48:15,274 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:48:15,275 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:48:15,276 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:48:15,283 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:48:15,283 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:48:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-08 12:48:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-08 12:48:15,311 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:15,312 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:48:15,313 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:15,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:15,320 INFO L82 PathProgramCache]: Analyzing trace with hash -64610451, now seen corresponding path program 1 times [2020-07-08 12:48:15,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:15,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119630169] [2020-07-08 12:48:15,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:15,496 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-08 12:48:15,497 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2020-07-08 12:48:15,499 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-08 12:48:15,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-08 12:48:15,499 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2020-07-08 12:48:15,500 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2020-07-08 12:48:15,500 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~z~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;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := 1;~c~0 := 1; {23#true} is VALID [2020-07-08 12:48:15,508 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#true} assume false; {24#false} is VALID [2020-07-08 12:48:15,508 INFO L263 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {24#false} is VALID [2020-07-08 12:48:15,509 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2020-07-08 12:48:15,509 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2020-07-08 12:48:15,510 INFO L280 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-08 12:48:15,511 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-08 12:48:15,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119630169] [2020-07-08 12:48:15,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:48:15,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 12:48:15,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841395789] [2020-07-08 12:48:15,536 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-08 12:48:15,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:15,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 12:48:15,590 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-08 12:48:15,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 12:48:15,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:15,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 12:48:15,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:48:15,605 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-08 12:48:15,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:15,713 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-07-08 12:48:15,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 12:48:15,714 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-08 12:48:15,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:48:15,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-08 12:48:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:48:15,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-08 12:48:15,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 45 transitions. [2020-07-08 12:48:15,846 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-08 12:48:15,858 INFO L225 Difference]: With dead ends: 35 [2020-07-08 12:48:15,858 INFO L226 Difference]: Without dead ends: 15 [2020-07-08 12:48:15,863 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-08 12:48:15,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-08 12:48:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-08 12:48:15,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:15,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-08 12:48:15,913 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-08 12:48:15,913 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-08 12:48:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:15,919 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-08 12:48:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-08 12:48:15,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:15,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:15,920 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-08 12:48:15,921 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-08 12:48:15,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:15,925 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-08 12:48:15,925 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-08 12:48:15,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:15,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:15,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:15,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 12:48:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-08 12:48:15,932 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-08 12:48:15,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:15,933 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-08 12:48:15,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 12:48:15,933 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-08 12:48:15,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-08 12:48:15,935 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:15,935 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:48:15,936 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:48:15,936 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:15,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:15,937 INFO L82 PathProgramCache]: Analyzing trace with hash -62822991, now seen corresponding path program 1 times [2020-07-08 12:48:15,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:15,938 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482822848] [2020-07-08 12:48:15,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:15,950 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:48:15,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [821899777] [2020-07-08 12:48:15,951 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-08 12:48:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:16,005 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-08 12:48:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:16,027 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:48:16,178 INFO L263 TraceCheckUtils]: 0: Hoare triple {129#true} call ULTIMATE.init(); {129#true} is VALID [2020-07-08 12:48:16,179 INFO L280 TraceCheckUtils]: 1: Hoare triple {129#true} assume true; {129#true} is VALID [2020-07-08 12:48:16,180 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {129#true} {129#true} #46#return; {129#true} is VALID [2020-07-08 12:48:16,180 INFO L263 TraceCheckUtils]: 3: Hoare triple {129#true} call #t~ret2 := main(); {129#true} is VALID [2020-07-08 12:48:16,183 INFO L280 TraceCheckUtils]: 4: Hoare triple {129#true} havoc ~z~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;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := 1;~c~0 := 1; {146#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-08 12:48:16,185 INFO L280 TraceCheckUtils]: 5: Hoare triple {146#(and (= 1 main_~x~0) (= 1 main_~y~0))} assume !false; {146#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-08 12:48:16,189 INFO L263 TraceCheckUtils]: 6: Hoare triple {146#(and (= 1 main_~x~0) (= 1 main_~y~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {153#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:48:16,190 INFO L280 TraceCheckUtils]: 7: Hoare triple {153#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {157#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:16,192 INFO L280 TraceCheckUtils]: 8: Hoare triple {157#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {130#false} is VALID [2020-07-08 12:48:16,192 INFO L280 TraceCheckUtils]: 9: Hoare triple {130#false} assume !false; {130#false} is VALID [2020-07-08 12:48:16,194 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-08 12:48:16,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482822848] [2020-07-08 12:48:16,195 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:48:16,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821899777] [2020-07-08 12:48:16,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:48:16,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:48:16,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310001755] [2020-07-08 12:48:16,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-08 12:48:16,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:16,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:48:16,222 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-08 12:48:16,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:48:16,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:16,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:48:16,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:48:16,225 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2020-07-08 12:48:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:16,442 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-08 12:48:16,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:48:16,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-08 12:48:16,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:16,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:48:16,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-08 12:48:16,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:48:16,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-08 12:48:16,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2020-07-08 12:48:16,506 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-08 12:48:16,509 INFO L225 Difference]: With dead ends: 25 [2020-07-08 12:48:16,509 INFO L226 Difference]: Without dead ends: 22 [2020-07-08 12:48:16,511 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-08 12:48:16,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-08 12:48:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-08 12:48:16,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:16,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-08 12:48:16,529 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-08 12:48:16,529 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-08 12:48:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:16,533 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-08 12:48:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-08 12:48:16,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:16,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:16,534 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-08 12:48:16,534 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-08 12:48:16,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:16,537 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-08 12:48:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-08 12:48:16,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:16,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:16,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:16,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-08 12:48:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-08 12:48:16,541 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2020-07-08 12:48:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:16,542 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-08 12:48:16,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:48:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-08 12:48:16,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-08 12:48:16,543 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:16,544 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:48:16,758 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-08 12:48:16,759 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:16,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:16,759 INFO L82 PathProgramCache]: Analyzing trace with hash 50868238, now seen corresponding path program 1 times [2020-07-08 12:48:16,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:16,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146714002] [2020-07-08 12:48:16,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:16,770 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:48:16,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1932014170] [2020-07-08 12:48:16,771 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-08 12:48:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:16,806 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-08 12:48:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:16,828 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:48:17,027 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-08 12:48:17,028 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-08 12:48:17,029 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #46#return; {279#true} is VALID [2020-07-08 12:48:17,029 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret2 := main(); {279#true} is VALID [2020-07-08 12:48:17,034 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} havoc ~z~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;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := 1;~c~0 := 1; {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-08 12:48:17,035 INFO L280 TraceCheckUtils]: 5: Hoare triple {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} assume !false; {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-08 12:48:17,036 INFO L263 TraceCheckUtils]: 6: Hoare triple {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {279#true} is VALID [2020-07-08 12:48:17,036 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} ~cond := #in~cond; {279#true} is VALID [2020-07-08 12:48:17,036 INFO L280 TraceCheckUtils]: 8: Hoare triple {279#true} assume !(0 == ~cond); {279#true} is VALID [2020-07-08 12:48:17,037 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-08 12:48:17,039 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {279#true} {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} #50#return; {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-08 12:48:17,041 INFO L280 TraceCheckUtils]: 11: Hoare triple {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {318#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} is VALID [2020-07-08 12:48:17,043 INFO L280 TraceCheckUtils]: 12: Hoare triple {318#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} assume !false; {318#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} is VALID [2020-07-08 12:48:17,049 INFO L263 TraceCheckUtils]: 13: Hoare triple {318#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {325#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:48:17,051 INFO L280 TraceCheckUtils]: 14: Hoare triple {325#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:17,052 INFO L280 TraceCheckUtils]: 15: Hoare triple {329#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {280#false} is VALID [2020-07-08 12:48:17,053 INFO L280 TraceCheckUtils]: 16: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-08 12:48:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:48:17,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146714002] [2020-07-08 12:48:17,060 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:48:17,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932014170] [2020-07-08 12:48:17,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:48:17,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-08 12:48:17,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591892292] [2020-07-08 12:48:17,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-08 12:48:17,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:17,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:48:17,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:48:17,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:48:17,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:17,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:48:17,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:48:17,093 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 6 states. [2020-07-08 12:48:27,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:27,288 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-08 12:48:27,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:48:27,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-08 12:48:27,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:48:27,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-08 12:48:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:48:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-08 12:48:27,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2020-07-08 12:48:29,474 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-08 12:48:29,477 INFO L225 Difference]: With dead ends: 32 [2020-07-08 12:48:29,477 INFO L226 Difference]: Without dead ends: 30 [2020-07-08 12:48:29,478 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:48:29,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-08 12:48:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-08 12:48:29,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:29,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2020-07-08 12:48:29,513 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2020-07-08 12:48:29,513 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2020-07-08 12:48:29,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:29,517 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-08 12:48:29,517 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-08 12:48:29,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:29,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:29,518 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2020-07-08 12:48:29,518 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2020-07-08 12:48:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:29,521 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-08 12:48:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-08 12:48:29,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:29,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:29,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:29,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-08 12:48:29,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-08 12:48:29,525 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 17 [2020-07-08 12:48:29,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:29,526 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-08 12:48:29,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:48:29,526 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-08 12:48:29,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 12:48:29,527 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:29,527 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:48:29,740 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:48:29,741 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:29,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:29,742 INFO L82 PathProgramCache]: Analyzing trace with hash 325764102, now seen corresponding path program 1 times [2020-07-08 12:48:29,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:29,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639696523] [2020-07-08 12:48:29,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:29,751 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:48:29,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1700266216] [2020-07-08 12:48:29,752 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-08 12:48:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:29,788 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-08 12:48:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:29,799 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:48:29,924 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:48:30,028 INFO L263 TraceCheckUtils]: 0: Hoare triple {486#true} call ULTIMATE.init(); {486#true} is VALID [2020-07-08 12:48:30,028 INFO L280 TraceCheckUtils]: 1: Hoare triple {486#true} assume true; {486#true} is VALID [2020-07-08 12:48:30,028 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {486#true} {486#true} #46#return; {486#true} is VALID [2020-07-08 12:48:30,029 INFO L263 TraceCheckUtils]: 3: Hoare triple {486#true} call #t~ret2 := main(); {486#true} is VALID [2020-07-08 12:48:30,029 INFO L280 TraceCheckUtils]: 4: Hoare triple {486#true} havoc ~z~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;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := 1;~c~0 := 1; {486#true} is VALID [2020-07-08 12:48:30,030 INFO L280 TraceCheckUtils]: 5: Hoare triple {486#true} assume !false; {486#true} is VALID [2020-07-08 12:48:30,030 INFO L263 TraceCheckUtils]: 6: Hoare triple {486#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {486#true} is VALID [2020-07-08 12:48:30,030 INFO L280 TraceCheckUtils]: 7: Hoare triple {486#true} ~cond := #in~cond; {486#true} is VALID [2020-07-08 12:48:30,031 INFO L280 TraceCheckUtils]: 8: Hoare triple {486#true} assume !(0 == ~cond); {486#true} is VALID [2020-07-08 12:48:30,031 INFO L280 TraceCheckUtils]: 9: Hoare triple {486#true} assume true; {486#true} is VALID [2020-07-08 12:48:30,031 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {486#true} {486#true} #50#return; {486#true} is VALID [2020-07-08 12:48:30,032 INFO L280 TraceCheckUtils]: 11: Hoare triple {486#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {486#true} is VALID [2020-07-08 12:48:30,032 INFO L280 TraceCheckUtils]: 12: Hoare triple {486#true} assume !false; {486#true} is VALID [2020-07-08 12:48:30,032 INFO L263 TraceCheckUtils]: 13: Hoare triple {486#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {486#true} is VALID [2020-07-08 12:48:30,034 INFO L280 TraceCheckUtils]: 14: Hoare triple {486#true} ~cond := #in~cond; {533#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:30,035 INFO L280 TraceCheckUtils]: 15: Hoare triple {533#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {537#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:48:30,036 INFO L280 TraceCheckUtils]: 16: Hoare triple {537#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {537#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:48:30,037 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {537#(not (= 0 |__VERIFIER_assert_#in~cond|))} {486#true} #50#return; {544#(= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0))} is VALID [2020-07-08 12:48:30,038 INFO L280 TraceCheckUtils]: 18: Hoare triple {544#(= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0))} assume !(~c~0 < ~k~0); {544#(= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0))} is VALID [2020-07-08 12:48:30,040 INFO L263 TraceCheckUtils]: 19: Hoare triple {544#(= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {551#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:48:30,042 INFO L280 TraceCheckUtils]: 20: Hoare triple {551#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {555#(= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:30,043 INFO L280 TraceCheckUtils]: 21: Hoare triple {555#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {487#false} is VALID [2020-07-08 12:48:30,044 INFO L280 TraceCheckUtils]: 22: Hoare triple {487#false} assume !false; {487#false} is VALID [2020-07-08 12:48:30,047 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-08 12:48:30,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639696523] [2020-07-08 12:48:30,048 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:48:30,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700266216] [2020-07-08 12:48:30,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:48:30,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-08 12:48:30,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182611757] [2020-07-08 12:48:30,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-08 12:48:30,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:30,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:48:30,099 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-08 12:48:30,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:48:30,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:30,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:48:30,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:48:30,102 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-07-08 12:48:35,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:35,028 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-08 12:48:35,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:48:35,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-08 12:48:35,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:35,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:48:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2020-07-08 12:48:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:48:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2020-07-08 12:48:35,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 24 transitions. [2020-07-08 12:48:35,091 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-08 12:48:35,093 INFO L225 Difference]: With dead ends: 34 [2020-07-08 12:48:35,093 INFO L226 Difference]: Without dead ends: 27 [2020-07-08 12:48:35,094 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:48:35,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-08 12:48:35,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-08 12:48:35,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:35,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-08 12:48:35,137 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-08 12:48:35,138 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-08 12:48:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:35,145 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-08 12:48:35,145 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-08 12:48:35,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:35,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:35,148 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-08 12:48:35,148 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-08 12:48:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:35,152 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-08 12:48:35,153 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-08 12:48:35,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:35,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:35,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:35,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-08 12:48:35,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-08 12:48:35,164 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2020-07-08 12:48:35,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:35,164 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-08 12:48:35,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:48:35,165 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-08 12:48:35,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:48:35,166 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:35,166 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:48:35,369 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:48:35,369 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:35,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:35,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1538749201, now seen corresponding path program 2 times [2020-07-08 12:48:35,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:35,372 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092406138] [2020-07-08 12:48:35,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:35,378 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:48:35,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [349609359] [2020-07-08 12:48:35,379 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-08 12:48:35,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:48:35,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:48:35,470 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-08 12:48:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-08 12:48:37,519 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:48:42,251 WARN L193 SmtUtils]: Spent 2.57 s on a formula simplification that was a NOOP. DAG size: 13 [2020-07-08 12:48:42,612 INFO L263 TraceCheckUtils]: 0: Hoare triple {708#true} call ULTIMATE.init(); {708#true} is VALID [2020-07-08 12:48:42,613 INFO L280 TraceCheckUtils]: 1: Hoare triple {708#true} assume true; {708#true} is VALID [2020-07-08 12:48:42,614 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {708#true} {708#true} #46#return; {708#true} is VALID [2020-07-08 12:48:42,614 INFO L263 TraceCheckUtils]: 3: Hoare triple {708#true} call #t~ret2 := main(); {708#true} is VALID [2020-07-08 12:48:42,618 INFO L280 TraceCheckUtils]: 4: Hoare triple {708#true} havoc ~z~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;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := 1;~c~0 := 1; {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-08 12:48:42,619 INFO L280 TraceCheckUtils]: 5: Hoare triple {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} assume !false; {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-08 12:48:42,619 INFO L263 TraceCheckUtils]: 6: Hoare triple {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {708#true} is VALID [2020-07-08 12:48:42,620 INFO L280 TraceCheckUtils]: 7: Hoare triple {708#true} ~cond := #in~cond; {708#true} is VALID [2020-07-08 12:48:42,620 INFO L280 TraceCheckUtils]: 8: Hoare triple {708#true} assume !(0 == ~cond); {708#true} is VALID [2020-07-08 12:48:42,620 INFO L280 TraceCheckUtils]: 9: Hoare triple {708#true} assume true; {708#true} is VALID [2020-07-08 12:48:42,622 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {708#true} {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} #50#return; {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-08 12:48:42,631 INFO L280 TraceCheckUtils]: 11: Hoare triple {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {747#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} is VALID [2020-07-08 12:48:42,633 INFO L280 TraceCheckUtils]: 12: Hoare triple {747#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} assume !false; {747#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} is VALID [2020-07-08 12:48:42,633 INFO L263 TraceCheckUtils]: 13: Hoare triple {747#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {708#true} is VALID [2020-07-08 12:48:42,635 INFO L280 TraceCheckUtils]: 14: Hoare triple {708#true} ~cond := #in~cond; {757#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:42,637 INFO L280 TraceCheckUtils]: 15: Hoare triple {757#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {761#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:48:42,638 INFO L280 TraceCheckUtils]: 16: Hoare triple {761#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {761#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:48:42,640 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {761#(not (= 0 |__VERIFIER_assert_#in~cond|))} {747#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} #50#return; {768#(and (= main_~x~0 (+ main_~z~0 1)) (= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0)) (= main_~z~0 main_~y~0))} is VALID [2020-07-08 12:48:42,653 INFO L280 TraceCheckUtils]: 18: Hoare triple {768#(and (= main_~x~0 (+ main_~z~0 1)) (= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0)) (= main_~z~0 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {772#(and (= (+ main_~z~0 (* main_~z~0 main_~z~0) 1) main_~x~0) (= main_~y~0 (* main_~z~0 main_~z~0)))} is VALID [2020-07-08 12:48:42,654 INFO L280 TraceCheckUtils]: 19: Hoare triple {772#(and (= (+ main_~z~0 (* main_~z~0 main_~z~0) 1) main_~x~0) (= main_~y~0 (* main_~z~0 main_~z~0)))} assume !false; {772#(and (= (+ main_~z~0 (* main_~z~0 main_~z~0) 1) main_~x~0) (= main_~y~0 (* main_~z~0 main_~z~0)))} is VALID [2020-07-08 12:48:44,699 INFO L263 TraceCheckUtils]: 20: Hoare triple {772#(and (= (+ main_~z~0 (* main_~z~0 main_~z~0) 1) main_~x~0) (= main_~y~0 (* main_~z~0 main_~z~0)))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {779#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2020-07-08 12:48:44,701 INFO L280 TraceCheckUtils]: 21: Hoare triple {779#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {783#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:44,702 INFO L280 TraceCheckUtils]: 22: Hoare triple {783#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {709#false} is VALID [2020-07-08 12:48:44,702 INFO L280 TraceCheckUtils]: 23: Hoare triple {709#false} assume !false; {709#false} is VALID [2020-07-08 12:48:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:48:44,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092406138] [2020-07-08 12:48:44,705 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:48:44,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349609359] [2020-07-08 12:48:44,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:48:44,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-08 12:48:44,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398659677] [2020-07-08 12:48:44,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-08 12:48:44,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:44,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 12:48:46,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-08 12:48:46,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 12:48:46,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:46,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 12:48:46,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2020-07-08 12:48:46,820 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 10 states. [2020-07-08 12:49:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:49:43,167 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-08 12:49:43,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:49:43,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-08 12:49:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:49:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:49:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-08 12:49:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:49:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-08 12:49:43,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 31 transitions. [2020-07-08 12:49:45,424 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-08 12:49:45,425 INFO L225 Difference]: With dead ends: 37 [2020-07-08 12:49:45,425 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 12:49:45,426 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=30, Invalid=101, Unknown=1, NotChecked=0, Total=132 [2020-07-08 12:49:45,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 12:49:45,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-08 12:49:45,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:49:45,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2020-07-08 12:49:45,466 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2020-07-08 12:49:45,466 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2020-07-08 12:49:45,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:49:45,469 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-08 12:49:45,469 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-08 12:49:45,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:49:45,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:49:45,470 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2020-07-08 12:49:45,470 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2020-07-08 12:49:45,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:49:45,472 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-08 12:49:45,472 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-08 12:49:45,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:49:45,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:49:45,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:49:45,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:49:45,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-08 12:49:45,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2020-07-08 12:49:45,476 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2020-07-08 12:49:45,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:49:45,476 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2020-07-08 12:49:45,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 12:49:45,477 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-08 12:49:45,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 12:49:45,478 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:49:45,478 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:49:45,691 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:49:45,692 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:49:45,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:49:45,692 INFO L82 PathProgramCache]: Analyzing trace with hash -695576914, now seen corresponding path program 3 times [2020-07-08 12:49:45,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:49:45,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987619614] [2020-07-08 12:49:45,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:49:45,701 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:49:45,702 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048152011] [2020-07-08 12:49:45,702 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-08 12:49:45,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-08 12:49:45,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:49:45,749 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-08 12:49:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-08 12:49:47,807 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:49:51,507 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:50:17,698 WARN L193 SmtUtils]: Spent 13.38 s on a formula simplification that was a NOOP. DAG size: 23 [2020-07-08 12:50:17,717 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:50:46,718 WARN L193 SmtUtils]: Spent 14.38 s on a formula simplification that was a NOOP. DAG size: 23 [2020-07-08 12:50:48,796 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:50:57,007 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_13 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13))) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) .cse0) (+ 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_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ .cse0 1))))) is different from false [2020-07-08 12:50:59,018 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_13 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13))) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) .cse0) (+ 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_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ .cse0 1))))) is different from true [2020-07-08 12:50:59,020 INFO L263 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2020-07-08 12:50:59,020 INFO L280 TraceCheckUtils]: 1: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-08 12:50:59,020 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {966#true} {966#true} #46#return; {966#true} is VALID [2020-07-08 12:50:59,020 INFO L263 TraceCheckUtils]: 3: Hoare triple {966#true} call #t~ret2 := main(); {966#true} is VALID [2020-07-08 12:50:59,020 INFO L280 TraceCheckUtils]: 4: Hoare triple {966#true} havoc ~z~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;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := 1;~c~0 := 1; {966#true} is VALID [2020-07-08 12:50:59,021 INFO L280 TraceCheckUtils]: 5: Hoare triple {966#true} assume !false; {966#true} is VALID [2020-07-08 12:50:59,021 INFO L263 TraceCheckUtils]: 6: Hoare triple {966#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {966#true} is VALID [2020-07-08 12:50:59,021 INFO L280 TraceCheckUtils]: 7: Hoare triple {966#true} ~cond := #in~cond; {966#true} is VALID [2020-07-08 12:50:59,021 INFO L280 TraceCheckUtils]: 8: Hoare triple {966#true} assume !(0 == ~cond); {966#true} is VALID [2020-07-08 12:50:59,022 INFO L280 TraceCheckUtils]: 9: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-08 12:50:59,022 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {966#true} {966#true} #50#return; {966#true} is VALID [2020-07-08 12:50:59,022 INFO L280 TraceCheckUtils]: 11: Hoare triple {966#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {966#true} is VALID [2020-07-08 12:50:59,022 INFO L280 TraceCheckUtils]: 12: Hoare triple {966#true} assume !false; {966#true} is VALID [2020-07-08 12:50:59,023 INFO L263 TraceCheckUtils]: 13: Hoare triple {966#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {966#true} is VALID [2020-07-08 12:50:59,023 INFO L280 TraceCheckUtils]: 14: Hoare triple {966#true} ~cond := #in~cond; {966#true} is VALID [2020-07-08 12:50:59,023 INFO L280 TraceCheckUtils]: 15: Hoare triple {966#true} assume !(0 == ~cond); {966#true} is VALID [2020-07-08 12:50:59,023 INFO L280 TraceCheckUtils]: 16: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-08 12:50:59,024 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {966#true} {966#true} #50#return; {966#true} is VALID [2020-07-08 12:50:59,024 INFO L280 TraceCheckUtils]: 18: Hoare triple {966#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {966#true} is VALID [2020-07-08 12:50:59,024 INFO L280 TraceCheckUtils]: 19: Hoare triple {966#true} assume !false; {966#true} is VALID [2020-07-08 12:50:59,024 INFO L263 TraceCheckUtils]: 20: Hoare triple {966#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {966#true} is VALID [2020-07-08 12:50:59,025 INFO L280 TraceCheckUtils]: 21: Hoare triple {966#true} ~cond := #in~cond; {1034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:50:59,027 INFO L280 TraceCheckUtils]: 22: Hoare triple {1034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1038#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:50:59,029 INFO L280 TraceCheckUtils]: 23: Hoare triple {1038#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {1038#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:50:59,031 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1038#(not (= 0 |__VERIFIER_assert_#in~cond|))} {966#true} #50#return; {1045#(= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0))} is VALID [2020-07-08 12:50:59,049 INFO L280 TraceCheckUtils]: 25: Hoare triple {1045#(= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {1049#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_13 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_13) 1)) (= (+ (* main_~z~0 v_main_~x~0_13) 1) (+ (* main_~z~0 v_main_~y~0_13) v_main_~x~0_13))))} is VALID [2020-07-08 12:50:59,053 INFO L280 TraceCheckUtils]: 26: Hoare triple {1049#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_13 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_13) 1)) (= (+ (* main_~z~0 v_main_~x~0_13) 1) (+ (* main_~z~0 v_main_~y~0_13) v_main_~x~0_13))))} assume !false; {1049#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_13 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_13) 1)) (= (+ (* main_~z~0 v_main_~x~0_13) 1) (+ (* main_~z~0 v_main_~y~0_13) v_main_~x~0_13))))} is VALID [2020-07-08 12:51:01,095 INFO L263 TraceCheckUtils]: 27: Hoare triple {1049#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_13 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_13) 1)) (= (+ (* main_~z~0 v_main_~x~0_13) 1) (+ (* main_~z~0 v_main_~y~0_13) v_main_~x~0_13))))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {1056#(or (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_13 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_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_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13) 1))))) (<= 1 |__VERIFIER_assert_#in~cond|))} is UNKNOWN [2020-07-08 12:51:01,097 INFO L280 TraceCheckUtils]: 28: Hoare triple {1056#(or (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_13 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_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_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13) 1))))) (<= 1 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1060#(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_13 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_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_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13) 1))))))} is VALID [2020-07-08 12:51:01,098 INFO L280 TraceCheckUtils]: 29: Hoare triple {1060#(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_13 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_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_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13) 1))))))} assume 0 == ~cond; {1064#(exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 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_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_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13) 1))))} is VALID [2020-07-08 12:51:03,121 INFO L280 TraceCheckUtils]: 30: Hoare triple {1064#(exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 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_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_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13) 1))))} assume !false; {967#false} is UNKNOWN [2020-07-08 12:51:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-08 12:51:03,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987619614] [2020-07-08 12:51:03,125 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:51:03,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048152011] [2020-07-08 12:51:03,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:51:03,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-08 12:51:03,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424435027] [2020-07-08 12:51:03,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-07-08 12:51:03,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:51:03,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 12:51:11,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 18 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2020-07-08 12:51:11,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 12:51:11,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:51:11,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 12:51:11,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=39, Unknown=6, NotChecked=12, Total=72 [2020-07-08 12:51:11,459 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 9 states. [2020-07-08 12:51:33,135 WARN L193 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 26 DAG size of output: 3 [2020-07-08 12:51:45,191 WARN L193 SmtUtils]: Spent 8.41 s on a formula simplification. DAG size of input: 32 DAG size of output: 6 [2020-07-08 12:52:32,890 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_13 Int)) (let ((.cse1 (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13))) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) .cse1) (+ 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_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ .cse1 1))))))) (and (or (and (<= 0 |c___VERIFIER_assert_#in~cond|) .cse0) (<= 1 |c___VERIFIER_assert_#in~cond|)) (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-08 12:52:49,411 WARN L193 SmtUtils]: Spent 6.18 s on a formula simplification that was a NOOP. DAG size: 21 [2020-07-08 12:53:05,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:53:05,330 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-08 12:53:05,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 12:53:05,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-07-08 12:53:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:53:05,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:53:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2020-07-08 12:53:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:53:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2020-07-08 12:53:05,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 21 transitions. [2020-07-08 12:53:11,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 18 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2020-07-08 12:53:11,640 INFO L225 Difference]: With dead ends: 34 [2020-07-08 12:53:11,640 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:53:11,641 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 78.9s TimeCoverageRelationStatistics Valid=32, Invalid=76, Unknown=10, NotChecked=38, Total=156 [2020-07-08 12:53:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:53:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:53:11,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:53:11,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:53:11,642 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:53:11,642 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:53:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:53:11,643 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:53:11,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:53:11,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:53:11,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:53:11,643 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:53:11,644 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:53:11,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:53:11,644 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:53:11,644 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:53:11,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:53:11,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:53:11,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:53:11,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:53:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:53:11,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:53:11,645 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2020-07-08 12:53:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:53:11,646 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:53:11,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 12:53:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:53:11,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:53:11,854 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-08 12:53:11,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:53:12,132 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2020-07-08 12:53:24,202 WARN L193 SmtUtils]: Spent 12.07 s on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2020-07-08 12:53:30,409 WARN L193 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 30 DAG size of output: 1 [2020-07-08 12:53:36,642 WARN L193 SmtUtils]: Spent 6.23 s on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2020-07-08 12:53:36,648 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 12:53:36,648 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:53:36,648 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:53:36,648 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:53:36,648 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:53:36,649 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:53:36,649 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 9 11) no Hoare annotation was computed. [2020-07-08 12:53:36,649 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-08 12:53:36,649 INFO L268 CegarLoopResult]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2020-07-08 12:53:36,649 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2020-07-08 12:53:36,649 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (or (and (= (+ (* main_~x~0 main_~z~0) 1) (+ main_~x~0 (* main_~y~0 main_~z~0))) (= 1 main_~y~0)) (exists ((v_main_~y~0_13 Int) (v_main_~x~0_13 Int)) (let ((.cse1 (+ (* main_~z~0 v_main_~x~0_13) 1)) (.cse0 (* main_~z~0 v_main_~y~0_13))) (and (= main_~y~0 .cse0) (= .cse1 main_~x~0) (= .cse1 (+ .cse0 v_main_~x~0_13)))))) [2020-07-08 12:53:36,650 INFO L268 CegarLoopResult]: For program point L32-1(lines 31 40) no Hoare annotation was computed. [2020-07-08 12:53:36,650 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 21 43) the Hoare annotation is: true [2020-07-08 12:53:36,650 INFO L264 CegarLoopResult]: At program point L31-2(lines 31 40) the Hoare annotation is: (or (and (= (+ (* main_~x~0 main_~z~0) 1) (+ main_~x~0 (* main_~y~0 main_~z~0))) (= 1 main_~y~0)) (exists ((v_main_~y~0_13 Int) (v_main_~x~0_13 Int)) (let ((.cse1 (+ (* main_~z~0 v_main_~x~0_13) 1)) (.cse0 (* main_~z~0 v_main_~y~0_13))) (and (= main_~y~0 .cse0) (= .cse1 main_~x~0) (= .cse1 (+ .cse0 v_main_~x~0_13)))))) [2020-07-08 12:53:36,650 INFO L264 CegarLoopResult]: At program point L31-3(lines 31 40) the Hoare annotation is: (= (+ (* main_~x~0 main_~z~0) 1) (+ main_~x~0 (* main_~y~0 main_~z~0))) [2020-07-08 12:53:36,650 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 21 43) no Hoare annotation was computed. [2020-07-08 12:53:36,650 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 21 43) no Hoare annotation was computed. [2020-07-08 12:53:36,650 INFO L268 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2020-07-08 12:53:36,651 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 12 18) the Hoare annotation is: true [2020-07-08 12:53:36,651 INFO L268 CegarLoopResult]: For program point L14(lines 14 15) no Hoare annotation was computed. [2020-07-08 12:53:36,651 INFO L268 CegarLoopResult]: For program point L13(lines 13 16) no Hoare annotation was computed. [2020-07-08 12:53:36,651 INFO L268 CegarLoopResult]: For program point L13-2(lines 12 18) no Hoare annotation was computed. [2020-07-08 12:53:36,651 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 12 18) no Hoare annotation was computed. [2020-07-08 12:53:36,651 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2020-07-08 12:53:36,657 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:53:36,657 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:53:36,659 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:53:36,659 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:53:36,659 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:53:36,659 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-08 12:53:36,659 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-08 12:53:36,663 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:53:36,663 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:53:36,663 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:53:36,664 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2020-07-08 12:53:36,664 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-08 12:53:36,664 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-08 12:53:36,664 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 12:53:36,664 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 12:53:36,665 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-08 12:53:36,665 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-08 12:53:36,665 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-08 12:53:36,665 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-08 12:53:36,665 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:53:36,665 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:53:36,665 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:53:36,665 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:53:36,666 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:53:36,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-08 12:53:36,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-08 12:53:36,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-08 12:53:36,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-08 12:53:36,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-08 12:53:36,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-08 12:53:36,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-08 12:53:36,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-08 12:53:36,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-08 12:53:36,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-08 12:53:36,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:53:36 BoogieIcfgContainer [2020-07-08 12:53:36,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:53:36,686 INFO L168 Benchmark]: Toolchain (without parser) took 322274.43 ms. Allocated memory was 137.9 MB in the beginning and 270.5 MB in the end (delta: 132.6 MB). Free memory was 102.0 MB in the beginning and 216.2 MB in the end (delta: -114.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:53:36,687 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 12:53:36,688 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.84 ms. Allocated memory is still 137.9 MB. Free memory was 101.6 MB in the beginning and 91.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:53:36,689 INFO L168 Benchmark]: Boogie Preprocessor took 132.14 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 91.9 MB in the beginning and 179.7 MB in the end (delta: -87.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:53:36,690 INFO L168 Benchmark]: RCFGBuilder took 333.08 ms. Allocated memory is still 201.9 MB. Free memory was 179.7 MB in the beginning and 163.8 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:53:36,691 INFO L168 Benchmark]: TraceAbstraction took 321526.05 ms. Allocated memory was 201.9 MB in the beginning and 270.5 MB in the end (delta: 68.7 MB). Free memory was 163.2 MB in the beginning and 216.2 MB in the end (delta: -53.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:53:36,695 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.21 ms. Allocated memory is still 137.9 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 276.84 ms. Allocated memory is still 137.9 MB. Free memory was 101.6 MB in the beginning and 91.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.14 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 91.9 MB in the beginning and 179.7 MB in the end (delta: -87.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 333.08 ms. Allocated memory is still 201.9 MB. Free memory was 179.7 MB in the beginning and 163.8 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 321526.05 ms. Allocated memory was 201.9 MB in the beginning and 270.5 MB in the end (delta: 68.7 MB). Free memory was 163.2 MB in the beginning and 216.2 MB in the end (delta: -53.0 MB). Peak memory consumption was 15.7 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_~x~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~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_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_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~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_13,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: 31]: Loop Invariant [2020-07-08 12:53:36,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-08 12:53:36,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-08 12:53:36,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-08 12:53:36,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-08 12:53:36,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-08 12:53:36,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-08 12:53:36,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-08 12:53:36,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-08 12:53:36,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-08 12:53:36,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] Derived loop invariant: (x * z + 1 == x + y * z && 1 == y) || (\exists v_main_~y~0_13 : int, v_main_~x~0_13 : int :: (y == z * v_main_~y~0_13 && z * v_main_~x~0_13 + 1 == x) && z * v_main_~x~0_13 + 1 == z * v_main_~y~0_13 + v_main_~x~0_13) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 296.5s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 196.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 24.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 83 SDtfs, 46 SDslu, 256 SDs, 0 SdLazy, 183 SolverSat, 10 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 35.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 84.2s 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.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 15 PreInvPairs, 25 NumberOfFragments, 98 HoareAnnotationTreeSize, 15 FomulaSimplifications, 222 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 89 FormulaSimplificationTreeSizeReductionInter, 22.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 87.4s InterpolantComputationTime, 115 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 109 ConstructedInterpolants, 5 QuantifiedInterpolants, 10860 SizeOfPredicates, 13 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 51/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...