java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-crafted/xor4.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:31:16,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:31:16,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:31:16,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:31:16,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:31:16,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:31:16,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:31:16,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:31:16,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:31:16,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:31:16,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:31:16,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:31:16,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:31:16,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:31:16,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:31:16,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:31:16,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:31:16,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:31:16,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:31:16,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:31:16,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:31:16,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:31:16,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:31:16,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:31:16,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:31:16,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:31:16,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:31:16,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:31:16,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:31:16,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:31:16,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:31:16,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:31:16,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:31:16,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:31:16,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:31:16,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:31:16,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:31:16,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:31:16,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:31:16,472 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:31:16,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:31:16,473 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 [2019-10-13 21:31:16,490 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:31:16,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:31:16,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:31:16,493 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:31:16,493 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:31:16,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:31:16,494 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:31:16,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:31:16,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:31:16,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:31:16,496 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:31:16,496 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:31:16,496 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:31:16,497 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:31:16,497 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:31:16,497 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:31:16,497 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:31:16,497 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:31:16,498 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:31:16,498 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:31:16,498 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:31:16,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:31:16,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:31:16,499 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:31:16,499 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:31:16,500 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:31:16,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:31:16,500 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:31:16,500 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:31:16,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:31:16,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:31:16,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:31:16,812 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:31:16,812 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:31:16,813 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/xor4.i [2019-10-13 21:31:16,886 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdedbc730/de1d982ce3644058a1912df157e98d89/FLAG203139dc2 [2019-10-13 21:31:17,347 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:31:17,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/xor4.i [2019-10-13 21:31:17,355 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdedbc730/de1d982ce3644058a1912df157e98d89/FLAG203139dc2 [2019-10-13 21:31:17,771 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdedbc730/de1d982ce3644058a1912df157e98d89 [2019-10-13 21:31:17,785 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:31:17,787 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:31:17,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:31:17,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:31:17,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:31:17,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:31:17" (1/1) ... [2019-10-13 21:31:17,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c88bd56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:17, skipping insertion in model container [2019-10-13 21:31:17,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:31:17" (1/1) ... [2019-10-13 21:31:17,806 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:31:17,828 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:31:18,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:31:18,092 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:31:18,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:31:18,294 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:31:18,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:18 WrapperNode [2019-10-13 21:31:18,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:31:18,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:31:18,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:31:18,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:31:18,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:18" (1/1) ... [2019-10-13 21:31:18,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:18" (1/1) ... [2019-10-13 21:31:18,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:18" (1/1) ... [2019-10-13 21:31:18,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:18" (1/1) ... [2019-10-13 21:31:18,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:18" (1/1) ... [2019-10-13 21:31:18,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:18" (1/1) ... [2019-10-13 21:31:18,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:18" (1/1) ... [2019-10-13 21:31:18,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:31:18,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:31:18,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:31:18,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:31:18,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:18" (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 [2019-10-13 21:31:18,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:31:18,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:31:18,410 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2019-10-13 21:31:18,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:31:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:31:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:31:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2019-10-13 21:31:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:31:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:31:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:31:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:31:18,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:31:18,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:31:18,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:31:18,794 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:31:18,794 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 21:31:18,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:31:18 BoogieIcfgContainer [2019-10-13 21:31:18,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:31:18,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:31:18,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:31:18,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:31:18,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:31:17" (1/3) ... [2019-10-13 21:31:18,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c54410f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:31:18, skipping insertion in model container [2019-10-13 21:31:18,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:18" (2/3) ... [2019-10-13 21:31:18,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c54410f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:31:18, skipping insertion in model container [2019-10-13 21:31:18,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:31:18" (3/3) ... [2019-10-13 21:31:18,803 INFO L109 eAbstractionObserver]: Analyzing ICFG xor4.i [2019-10-13 21:31:18,811 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:31:18,817 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:31:18,827 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:31:18,848 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:31:18,848 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:31:18,848 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:31:18,848 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:31:18,849 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:31:18,849 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:31:18,849 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:31:18,849 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:31:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-13 21:31:18,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:31:18,870 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:31:18,871 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:31:18,873 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:31:18,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:31:18,879 INFO L82 PathProgramCache]: Analyzing trace with hash -809725829, now seen corresponding path program 1 times [2019-10-13 21:31:18,887 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:31:18,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456936046] [2019-10-13 21:31:18,888 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:18,888 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:18,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:31:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:31:19,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456936046] [2019-10-13 21:31:19,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:31:19,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:31:19,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891780202] [2019-10-13 21:31:19,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:31:19,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:31:19,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:31:19,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:31:19,095 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-13 21:31:19,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:31:19,128 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-10-13 21:31:19,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:31:19,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 21:31:19,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:31:19,140 INFO L225 Difference]: With dead ends: 41 [2019-10-13 21:31:19,140 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 21:31:19,144 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:31:19,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 21:31:19,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 21:31:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 21:31:19,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-13 21:31:19,189 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-10-13 21:31:19,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:31:19,190 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-13 21:31:19,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:31:19,190 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-13 21:31:19,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:31:19,193 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:31:19,193 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:31:19,193 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:31:19,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:31:19,194 INFO L82 PathProgramCache]: Analyzing trace with hash 994996090, now seen corresponding path program 1 times [2019-10-13 21:31:19,194 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:31:19,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216541782] [2019-10-13 21:31:19,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:19,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:19,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:31:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:31:19,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216541782] [2019-10-13 21:31:19,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706101743] [2019-10-13 21:31:19,278 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 [2019-10-13 21:31:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:19,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:31:19,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:31:19,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:31:19,417 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:31:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:31:19,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:31:19,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2019-10-13 21:31:19,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053117733] [2019-10-13 21:31:19,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:31:19,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:31:19,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:31:19,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:31:19,464 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-13 21:31:19,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:31:19,488 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-10-13 21:31:19,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:31:19,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 21:31:19,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:31:19,490 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:31:19,490 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 21:31:19,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:31:19,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 21:31:19,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-13 21:31:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 21:31:19,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-13 21:31:19,505 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-13 21:31:19,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:31:19,506 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-13 21:31:19,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:31:19,507 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-13 21:31:19,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:31:19,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:31:19,510 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:31:19,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:31:19,716 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:31:19,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:31:19,717 INFO L82 PathProgramCache]: Analyzing trace with hash -421018474, now seen corresponding path program 1 times [2019-10-13 21:31:19,717 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:31:19,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210366927] [2019-10-13 21:31:19,717 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:19,718 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:19,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:31:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:31:19,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210366927] [2019-10-13 21:31:19,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:31:19,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:31:19,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137179691] [2019-10-13 21:31:19,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:31:19,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:31:19,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:31:19,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:31:19,840 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-10-13 21:31:19,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:31:19,861 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-13 21:31:19,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:31:19,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 21:31:19,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:31:19,863 INFO L225 Difference]: With dead ends: 31 [2019-10-13 21:31:19,863 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 21:31:19,864 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:31:19,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 21:31:19,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-13 21:31:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:31:19,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-13 21:31:19,877 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2019-10-13 21:31:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:31:19,881 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-13 21:31:19,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:31:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-13 21:31:19,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:31:19,889 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:31:19,889 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:31:19,890 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:31:19,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:31:19,890 INFO L82 PathProgramCache]: Analyzing trace with hash -661634715, now seen corresponding path program 1 times [2019-10-13 21:31:19,891 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:31:19,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626520346] [2019-10-13 21:31:19,891 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:19,891 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:19,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:31:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:19,978 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:31:19,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626520346] [2019-10-13 21:31:19,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768627697] [2019-10-13 21:31:19,980 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 [2019-10-13 21:31:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:20,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:31:20,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:31:20,100 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:31:20,103 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:31:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:31:20,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1288932448] [2019-10-13 21:31:20,168 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:31:20,168 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:31:20,177 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:31:20,185 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:31:20,186 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:31:20,347 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:31:22,437 INFO L199 IcfgInterpreter]: Interpreting procedure xor with input of size 1 for LOIs [2019-10-13 21:31:22,497 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:31:22,501 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:31:22,501 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:31:22,502 INFO L193 IcfgInterpreter]: Reachable states at location xorEXIT satisfy 644#(and (not (< xor_~i~0 100000)) (<= 1 xor_~i~0) (= (ite (<= (mod xor_~res~0 4294967296) 2147483647) (mod xor_~res~0 4294967296) (+ (mod xor_~res~0 4294967296) (- 4294967296))) |xor_#res|) (<= 100000 xor_~i~0)) [2019-10-13 21:31:22,502 INFO L193 IcfgInterpreter]: Reachable states at location L26-4 satisfy 73#(and (not (< main_~i~1 100000)) (<= 100000 main_~i~1)) [2019-10-13 21:31:22,502 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 592#(exists ((v_prenex_2 Int) (v_xor_~res~0_BEFORE_RETURN_2 Int) (v_prenex_1 Int) (v_xor_~res~0_BEFORE_RETURN_1 Int)) (or (and (not (< main_~i~1 100000)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~0 (mod v_prenex_2 4294967296)) (<= main_~ret~0 2147483647) (<= (mod v_prenex_2 4294967296) 2147483647)) (and (not (< main_~i~1 100000)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_2 4294967296) 2147483647)) (= (+ (mod v_xor_~res~0_BEFORE_RETURN_2 4294967296) (- 4294967296)) main_~ret~0) (<= main_~ret~0 2147483647)) (and (not (< main_~i~1 100000)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~0 (+ (mod v_prenex_1 4294967296) (- 4294967296))) (<= main_~ret~0 2147483647) (not (<= (mod v_prenex_1 4294967296) 2147483647))) (and (not (< main_~i~1 100000)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= main_~ret~0 2147483647) (<= (mod v_xor_~res~0_BEFORE_RETURN_1 4294967296) 2147483647) (= main_~ret~0 (mod v_xor_~res~0_BEFORE_RETURN_1 4294967296))))) [2019-10-13 21:31:22,503 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 648#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:31:22,503 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 68#true [2019-10-13 21:31:22,503 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 639#(<= 1 xor_~i~0) [2019-10-13 21:31:22,503 INFO L193 IcfgInterpreter]: Reachable states at location xorENTRY satisfy 601#true [2019-10-13 21:31:22,504 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:22,504 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:22,504 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 653#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:22,504 INFO L193 IcfgInterpreter]: Reachable states at location L39-1 satisfy 479#true [2019-10-13 21:31:22,504 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:31:22,505 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 522#(and (not (< main_~i~2 99999)) (<= 99999 main_~i~2) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) [2019-10-13 21:31:22,505 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 120#(or (exists ((v_xor_~res~0_BEFORE_RETURN_1 Int) (v_prenex_1 Int)) (or (and (= (mod v_xor_~res~0_BEFORE_RETURN_1 4294967296) |main_#t~ret5|) (not (< main_~i~1 100000)) (<= (mod v_xor_~res~0_BEFORE_RETURN_1 4294967296) 2147483647)) (and (not (< main_~i~1 100000)) (= (+ (mod v_prenex_1 4294967296) (- 4294967296)) |main_#t~ret5|) (not (<= (mod v_prenex_1 4294967296) 2147483647))))) (exists ((v_prenex_2 Int) (v_xor_~res~0_BEFORE_RETURN_2 Int)) (or (and (not (< main_~i~1 100000)) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_2 4294967296) 2147483647)) (= (+ (mod v_xor_~res~0_BEFORE_RETURN_2 4294967296) (- 4294967296)) |main_#t~ret5|)) (and (= |main_#t~ret5| (mod v_prenex_2 4294967296)) (not (< main_~i~1 100000)) (<= (mod v_prenex_2 4294967296) 2147483647))))) [2019-10-13 21:31:22,505 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (and (exists ((v_prenex_29 Int) (v_prenex_30 Int) (v_xor_~res~0_BEFORE_RETURN_6 Int) (v_xor_~res~0_BEFORE_RETURN_5 Int)) (or (and (= main_~ret5~0 (mod v_prenex_30 4294967296)) (<= (mod v_prenex_30 4294967296) 2147483647) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (<= (mod v_prenex_29 4294967296) 2147483647)) (not (< main_~i~2 99999)) (= main_~ret5~0 (+ (mod v_prenex_29 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_xor_~res~0_BEFORE_RETURN_6 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996))) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_6 4294967296) 2147483647))) (and (= main_~ret5~0 (mod v_xor_~res~0_BEFORE_RETURN_5 4294967296)) (<= (mod v_xor_~res~0_BEFORE_RETURN_5 4294967296) 2147483647) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))))) (not (= main_~ret~0 main_~ret5~0))) (and (not (= main_~ret~0 main_~ret2~0)) (exists ((v_prenex_29 Int) (v_prenex_30 Int) (v_xor_~res~0_BEFORE_RETURN_6 Int) (v_xor_~res~0_BEFORE_RETURN_5 Int)) (or (and (= main_~ret5~0 (mod v_prenex_30 4294967296)) (<= (mod v_prenex_30 4294967296) 2147483647) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (<= (mod v_prenex_29 4294967296) 2147483647)) (not (< main_~i~2 99999)) (= main_~ret5~0 (+ (mod v_prenex_29 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_xor_~res~0_BEFORE_RETURN_6 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996))) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_6 4294967296) 2147483647))) (and (= main_~ret5~0 (mod v_xor_~res~0_BEFORE_RETURN_5 4294967296)) (<= (mod v_xor_~res~0_BEFORE_RETURN_5 4294967296) 2147483647) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))))))) [2019-10-13 21:31:22,506 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 424#true [2019-10-13 21:31:22,506 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 313#true [2019-10-13 21:31:22,506 INFO L193 IcfgInterpreter]: Reachable states at location L33-1 satisfy 587#true [2019-10-13 21:31:22,506 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 560#true [2019-10-13 21:31:22,885 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:31:22,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 21:31:22,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623196441] [2019-10-13 21:31:22,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:31:22,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:31:22,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:31:22,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:31:22,888 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-13 21:31:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:31:23,646 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-10-13 21:31:23,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:31:23,647 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-10-13 21:31:23,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:31:23,648 INFO L225 Difference]: With dead ends: 40 [2019-10-13 21:31:23,648 INFO L226 Difference]: Without dead ends: 25 [2019-10-13 21:31:23,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2019-10-13 21:31:23,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-13 21:31:23,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-13 21:31:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 21:31:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-13 21:31:23,656 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 29 [2019-10-13 21:31:23,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:31:23,657 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-13 21:31:23,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:31:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-13 21:31:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 21:31:23,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:31:23,659 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:31:23,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:31:23,863 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:31:23,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:31:23,863 INFO L82 PathProgramCache]: Analyzing trace with hash -139894362, now seen corresponding path program 2 times [2019-10-13 21:31:23,863 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:31:23,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213653437] [2019-10-13 21:31:23,864 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:23,864 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:23,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:31:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:31:23,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213653437] [2019-10-13 21:31:23,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311302883] [2019-10-13 21:31:23,943 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 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 [2019-10-13 21:31:24,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:31:24,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:31:24,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:31:24,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:31:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:31:24,043 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:31:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:31:24,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1594634621] [2019-10-13 21:31:24,086 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:31:24,086 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:31:24,087 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:31:24,087 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:31:24,087 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:31:24,131 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:31:25,771 INFO L199 IcfgInterpreter]: Interpreting procedure xor with input of size 1 for LOIs [2019-10-13 21:31:25,815 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:31:25,819 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:31:25,819 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:31:25,819 INFO L193 IcfgInterpreter]: Reachable states at location xorEXIT satisfy 644#(and (not (< xor_~i~0 100000)) (<= 1 xor_~i~0) (= (ite (<= (mod xor_~res~0 4294967296) 2147483647) (mod xor_~res~0 4294967296) (+ (mod xor_~res~0 4294967296) (- 4294967296))) |xor_#res|) (<= 100000 xor_~i~0)) [2019-10-13 21:31:25,820 INFO L193 IcfgInterpreter]: Reachable states at location L26-4 satisfy 73#(and (not (< main_~i~1 100000)) (<= 100000 main_~i~1)) [2019-10-13 21:31:25,820 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 592#(exists ((v_prenex_196 Int) (v_xor_~res~0_BEFORE_RETURN_27 Int) (v_xor_~res~0_BEFORE_RETURN_28 Int) (v_prenex_195 Int)) (or (and (not (< main_~i~1 100000)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (mod v_prenex_195 4294967296) main_~ret~0) (<= main_~ret~0 2147483647) (<= (mod v_prenex_195 4294967296) 2147483647)) (and (not (<= (mod v_prenex_196 4294967296) 2147483647)) (not (< main_~i~1 100000)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= main_~ret~0 2147483647) (= (+ (mod v_prenex_196 4294967296) (- 4294967296)) main_~ret~0)) (and (not (<= (mod v_xor_~res~0_BEFORE_RETURN_27 4294967296) 2147483647)) (not (< main_~i~1 100000)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= main_~ret~0 2147483647) (= main_~ret~0 (+ (mod v_xor_~res~0_BEFORE_RETURN_27 4294967296) (- 4294967296)))) (and (<= (mod v_xor_~res~0_BEFORE_RETURN_28 4294967296) 2147483647) (not (< main_~i~1 100000)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= main_~ret~0 2147483647) (= (mod v_xor_~res~0_BEFORE_RETURN_28 4294967296) main_~ret~0)))) [2019-10-13 21:31:25,820 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 648#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:31:25,821 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 68#true [2019-10-13 21:31:25,821 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 639#(<= 1 xor_~i~0) [2019-10-13 21:31:25,821 INFO L193 IcfgInterpreter]: Reachable states at location xorENTRY satisfy 601#true [2019-10-13 21:31:25,821 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:25,821 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:25,822 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 653#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:25,822 INFO L193 IcfgInterpreter]: Reachable states at location L39-1 satisfy 479#true [2019-10-13 21:31:25,822 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:31:25,822 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 522#(and (not (< main_~i~2 99999)) (<= 99999 main_~i~2) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) [2019-10-13 21:31:25,823 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 120#(or (exists ((v_prenex_196 Int) (v_xor_~res~0_BEFORE_RETURN_28 Int)) (or (and (<= (mod v_xor_~res~0_BEFORE_RETURN_28 4294967296) 2147483647) (not (< main_~i~1 100000)) (= (mod v_xor_~res~0_BEFORE_RETURN_28 4294967296) |main_#t~ret5|)) (and (not (<= (mod v_prenex_196 4294967296) 2147483647)) (not (< main_~i~1 100000)) (= (+ (mod v_prenex_196 4294967296) (- 4294967296)) |main_#t~ret5|)))) (exists ((v_xor_~res~0_BEFORE_RETURN_27 Int) (v_prenex_195 Int)) (or (and (= (+ (mod v_xor_~res~0_BEFORE_RETURN_27 4294967296) (- 4294967296)) |main_#t~ret5|) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_27 4294967296) 2147483647)) (not (< main_~i~1 100000))) (and (= |main_#t~ret5| (mod v_prenex_195 4294967296)) (not (< main_~i~1 100000)) (<= (mod v_prenex_195 4294967296) 2147483647))))) [2019-10-13 21:31:25,823 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (and (not (= main_~ret~0 main_~ret2~0)) (exists ((v_xor_~res~0_BEFORE_RETURN_31 Int) (v_prenex_224 Int) (v_prenex_223 Int) (v_xor_~res~0_BEFORE_RETURN_32 Int)) (or (and (not (<= (mod v_prenex_223 4294967296) 2147483647)) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_prenex_223 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_224 4294967296) 2147483647) (= main_~ret5~0 (mod v_prenex_224 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (<= (mod v_xor_~res~0_BEFORE_RETURN_32 4294967296) 2147483647)) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_xor_~res~0_BEFORE_RETURN_32 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (= (mod v_xor_~res~0_BEFORE_RETURN_31 4294967296) main_~ret5~0) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_xor_~res~0_BEFORE_RETURN_31 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996))))))) (and (exists ((v_xor_~res~0_BEFORE_RETURN_31 Int) (v_prenex_224 Int) (v_prenex_223 Int) (v_xor_~res~0_BEFORE_RETURN_32 Int)) (or (and (not (<= (mod v_prenex_223 4294967296) 2147483647)) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_prenex_223 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_224 4294967296) 2147483647) (= main_~ret5~0 (mod v_prenex_224 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (<= (mod v_xor_~res~0_BEFORE_RETURN_32 4294967296) 2147483647)) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_xor_~res~0_BEFORE_RETURN_32 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (= (mod v_xor_~res~0_BEFORE_RETURN_31 4294967296) main_~ret5~0) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_xor_~res~0_BEFORE_RETURN_31 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))))) (not (= main_~ret~0 main_~ret5~0)))) [2019-10-13 21:31:25,823 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 424#true [2019-10-13 21:31:25,824 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 313#true [2019-10-13 21:31:25,824 INFO L193 IcfgInterpreter]: Reachable states at location L33-1 satisfy 587#true [2019-10-13 21:31:25,824 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 560#true [2019-10-13 21:31:26,203 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:31:26,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-13 21:31:26,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243987884] [2019-10-13 21:31:26,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 21:31:26,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:31:26,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 21:31:26,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-13 21:31:26,207 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 22 states. [2019-10-13 21:31:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:31:27,141 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-10-13 21:31:27,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 21:31:27,142 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-13 21:31:27,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:31:27,143 INFO L225 Difference]: With dead ends: 44 [2019-10-13 21:31:27,143 INFO L226 Difference]: Without dead ends: 29 [2019-10-13 21:31:27,144 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 21:31:27,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-13 21:31:27,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-13 21:31:27,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-13 21:31:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-13 21:31:27,168 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2019-10-13 21:31:27,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:31:27,168 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-13 21:31:27,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 21:31:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-13 21:31:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 21:31:27,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:31:27,172 INFO L380 BasicCegarLoop]: trace histogram [12, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:31:27,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:31:27,382 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:31:27,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:31:27,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1028595953, now seen corresponding path program 3 times [2019-10-13 21:31:27,382 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:31:27,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183549171] [2019-10-13 21:31:27,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:27,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:27,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:31:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:27,495 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 21:31:27,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183549171] [2019-10-13 21:31:27,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719037875] [2019-10-13 21:31:27,496 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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 [2019-10-13 21:31:27,596 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:31:27,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:31:27,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:31:27,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:31:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 21:31:27,620 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:31:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 21:31:27,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [742060902] [2019-10-13 21:31:27,702 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:31:27,705 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:31:27,706 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:31:27,706 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:31:27,706 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:31:27,727 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:31:29,440 INFO L199 IcfgInterpreter]: Interpreting procedure xor with input of size 1 for LOIs [2019-10-13 21:31:29,476 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:31:29,481 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:31:29,481 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:31:29,482 INFO L193 IcfgInterpreter]: Reachable states at location xorEXIT satisfy 644#(and (not (< xor_~i~0 100000)) (<= 1 xor_~i~0) (= (ite (<= (mod xor_~res~0 4294967296) 2147483647) (mod xor_~res~0 4294967296) (+ (mod xor_~res~0 4294967296) (- 4294967296))) |xor_#res|) (<= 100000 xor_~i~0)) [2019-10-13 21:31:29,482 INFO L193 IcfgInterpreter]: Reachable states at location L26-4 satisfy 73#(and (not (< main_~i~1 100000)) (<= 100000 main_~i~1)) [2019-10-13 21:31:29,482 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 592#(exists ((v_xor_~res~0_BEFORE_RETURN_53 Int) (v_prenex_389 Int) (v_xor_~res~0_BEFORE_RETURN_54 Int) (v_prenex_390 Int)) (or (and (not (< main_~i~1 100000)) (= (mod v_xor_~res~0_BEFORE_RETURN_54 4294967296) main_~ret~0) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= main_~ret~0 2147483647) (<= (mod v_xor_~res~0_BEFORE_RETURN_54 4294967296) 2147483647)) (and (not (< main_~i~1 100000)) (= (mod v_prenex_389 4294967296) main_~ret~0) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_prenex_389 4294967296) 2147483647) (<= main_~ret~0 2147483647)) (and (not (< main_~i~1 100000)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_prenex_390 4294967296) 2147483647)) (= (+ (mod v_prenex_390 4294967296) (- 4294967296)) main_~ret~0) (<= main_~ret~0 2147483647)) (and (= main_~ret~0 (+ (mod v_xor_~res~0_BEFORE_RETURN_53 4294967296) (- 4294967296))) (not (< main_~i~1 100000)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_53 4294967296) 2147483647)) (<= main_~ret~0 2147483647)))) [2019-10-13 21:31:29,483 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 648#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:31:29,483 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 68#true [2019-10-13 21:31:29,483 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 639#(<= 1 xor_~i~0) [2019-10-13 21:31:29,484 INFO L193 IcfgInterpreter]: Reachable states at location xorENTRY satisfy 601#true [2019-10-13 21:31:29,484 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:29,484 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:29,485 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 653#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:29,485 INFO L193 IcfgInterpreter]: Reachable states at location L39-1 satisfy 479#true [2019-10-13 21:31:29,485 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:31:29,486 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 522#(and (not (< main_~i~2 99999)) (<= 99999 main_~i~2) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) [2019-10-13 21:31:29,486 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 120#(or (exists ((v_xor_~res~0_BEFORE_RETURN_53 Int) (v_prenex_389 Int)) (or (and (not (< main_~i~1 100000)) (<= (mod v_prenex_389 4294967296) 2147483647) (= (mod v_prenex_389 4294967296) |main_#t~ret5|)) (and (= |main_#t~ret5| (+ (mod v_xor_~res~0_BEFORE_RETURN_53 4294967296) (- 4294967296))) (not (< main_~i~1 100000)) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_53 4294967296) 2147483647))))) (exists ((v_xor_~res~0_BEFORE_RETURN_54 Int) (v_prenex_390 Int)) (or (and (not (< main_~i~1 100000)) (not (<= (mod v_prenex_390 4294967296) 2147483647)) (= |main_#t~ret5| (+ (mod v_prenex_390 4294967296) (- 4294967296)))) (and (not (< main_~i~1 100000)) (= (mod v_xor_~res~0_BEFORE_RETURN_54 4294967296) |main_#t~ret5|) (<= (mod v_xor_~res~0_BEFORE_RETURN_54 4294967296) 2147483647))))) [2019-10-13 21:31:29,486 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (and (exists ((v_xor_~res~0_BEFORE_RETURN_57 Int) (v_xor_~res~0_BEFORE_RETURN_58 Int) (v_prenex_417 Int) (v_prenex_418 Int)) (or (and (= main_~ret5~0 (+ (mod v_xor_~res~0_BEFORE_RETURN_57 4294967296) (- 4294967296))) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_57 4294967296) 2147483647)) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_418 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_prenex_418 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (<= (mod v_xor_~res~0_BEFORE_RETURN_58 4294967296) 2147483647) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (mod v_xor_~res~0_BEFORE_RETURN_58 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (= (mod v_prenex_417 4294967296) main_~ret5~0) (not (< main_~i~2 99999)) (<= (mod v_prenex_417 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))))) (not (= main_~ret~0 main_~ret5~0))) (and (not (= main_~ret~0 main_~ret2~0)) (exists ((v_xor_~res~0_BEFORE_RETURN_57 Int) (v_xor_~res~0_BEFORE_RETURN_58 Int) (v_prenex_417 Int) (v_prenex_418 Int)) (or (and (= main_~ret5~0 (+ (mod v_xor_~res~0_BEFORE_RETURN_57 4294967296) (- 4294967296))) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_57 4294967296) 2147483647)) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_418 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_prenex_418 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (<= (mod v_xor_~res~0_BEFORE_RETURN_58 4294967296) 2147483647) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (mod v_xor_~res~0_BEFORE_RETURN_58 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (= (mod v_prenex_417 4294967296) main_~ret5~0) (not (< main_~i~2 99999)) (<= (mod v_prenex_417 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))))))) [2019-10-13 21:31:29,487 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 424#true [2019-10-13 21:31:29,487 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 313#true [2019-10-13 21:31:29,487 INFO L193 IcfgInterpreter]: Reachable states at location L33-1 satisfy 587#true [2019-10-13 21:31:29,488 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 560#true [2019-10-13 21:31:29,870 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:31:29,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-13 21:31:29,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930830447] [2019-10-13 21:31:29,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-13 21:31:29,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:31:29,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-13 21:31:29,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-10-13 21:31:29,873 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 26 states. [2019-10-13 21:31:30,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:31:30,832 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-10-13 21:31:30,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 21:31:30,833 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2019-10-13 21:31:30,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:31:30,834 INFO L225 Difference]: With dead ends: 54 [2019-10-13 21:31:30,834 INFO L226 Difference]: Without dead ends: 36 [2019-10-13 21:31:30,837 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-10-13 21:31:30,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-13 21:31:30,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-13 21:31:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 21:31:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-13 21:31:30,854 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 42 [2019-10-13 21:31:30,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:31:30,856 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-13 21:31:30,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-13 21:31:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-13 21:31:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 21:31:30,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:31:30,857 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:31:31,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:31:31,059 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:31:31,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:31:31,060 INFO L82 PathProgramCache]: Analyzing trace with hash -500498258, now seen corresponding path program 4 times [2019-10-13 21:31:31,060 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:31:31,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951173890] [2019-10-13 21:31:31,060 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:31,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:31,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:31:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:31,216 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 21:31:31,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951173890] [2019-10-13 21:31:31,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145572461] [2019-10-13 21:31:31,217 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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 [2019-10-13 21:31:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:31,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 21:31:31,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:31:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 21:31:31,377 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:31:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 21:31:31,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [138856932] [2019-10-13 21:31:31,797 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:31:31,797 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:31:31,798 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:31:31,798 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:31:31,799 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:31:31,825 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:31:33,098 INFO L199 IcfgInterpreter]: Interpreting procedure xor with input of size 1 for LOIs [2019-10-13 21:31:33,121 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:31:33,126 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:31:33,126 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:31:33,126 INFO L193 IcfgInterpreter]: Reachable states at location xorEXIT satisfy 644#(and (not (< xor_~i~0 100000)) (<= 1 xor_~i~0) (= (ite (<= (mod xor_~res~0 4294967296) 2147483647) (mod xor_~res~0 4294967296) (+ (mod xor_~res~0 4294967296) (- 4294967296))) |xor_#res|) (<= 100000 xor_~i~0)) [2019-10-13 21:31:33,127 INFO L193 IcfgInterpreter]: Reachable states at location L26-4 satisfy 73#(and (not (< main_~i~1 100000)) (<= 100000 main_~i~1)) [2019-10-13 21:31:33,127 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 592#(exists ((v_xor_~res~0_BEFORE_RETURN_79 Int) (v_prenex_583 Int) (v_prenex_584 Int) (v_xor_~res~0_BEFORE_RETURN_80 Int)) (or (and (not (< main_~i~1 100000)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= main_~ret~0 2147483647) (= (mod v_prenex_584 4294967296) main_~ret~0) (<= (mod v_prenex_584 4294967296) 2147483647)) (and (= main_~ret~0 (+ (mod v_xor_~res~0_BEFORE_RETURN_80 4294967296) (- 4294967296))) (not (< main_~i~1 100000)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_80 4294967296) 2147483647)) (<= main_~ret~0 2147483647)) (and (not (< main_~i~1 100000)) (<= (mod v_prenex_583 4294967296) 2147483647) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~0 (mod v_prenex_583 4294967296)) (<= main_~ret~0 2147483647)) (and (not (< main_~i~1 100000)) (= main_~ret~0 (+ (mod v_xor_~res~0_BEFORE_RETURN_79 4294967296) (- 4294967296))) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_79 4294967296) 2147483647)) (<= main_~ret~0 2147483647)))) [2019-10-13 21:31:33,127 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 648#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:31:33,127 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 68#true [2019-10-13 21:31:33,127 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 639#(<= 1 xor_~i~0) [2019-10-13 21:31:33,128 INFO L193 IcfgInterpreter]: Reachable states at location xorENTRY satisfy 601#true [2019-10-13 21:31:33,128 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:33,128 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:33,128 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 653#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:33,128 INFO L193 IcfgInterpreter]: Reachable states at location L39-1 satisfy 479#true [2019-10-13 21:31:33,129 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:31:33,129 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 522#(and (not (< main_~i~2 99999)) (<= 99999 main_~i~2) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) [2019-10-13 21:31:33,129 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 120#(or (exists ((v_prenex_584 Int) (v_xor_~res~0_BEFORE_RETURN_80 Int)) (or (and (not (< main_~i~1 100000)) (= (mod v_prenex_584 4294967296) |main_#t~ret5|) (<= (mod v_prenex_584 4294967296) 2147483647)) (and (not (< main_~i~1 100000)) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_80 4294967296) 2147483647)) (= |main_#t~ret5| (+ (mod v_xor_~res~0_BEFORE_RETURN_80 4294967296) (- 4294967296)))))) (exists ((v_xor_~res~0_BEFORE_RETURN_79 Int) (v_prenex_583 Int)) (or (and (not (< main_~i~1 100000)) (= (mod v_prenex_583 4294967296) |main_#t~ret5|) (<= (mod v_prenex_583 4294967296) 2147483647)) (and (not (< main_~i~1 100000)) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_79 4294967296) 2147483647)) (= |main_#t~ret5| (+ (mod v_xor_~res~0_BEFORE_RETURN_79 4294967296) (- 4294967296))))))) [2019-10-13 21:31:33,129 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (and (exists ((v_prenex_611 Int) (v_prenex_612 Int) (v_xor_~res~0_BEFORE_RETURN_83 Int) (v_xor_~res~0_BEFORE_RETURN_84 Int)) (or (and (= main_~ret5~0 (mod v_xor_~res~0_BEFORE_RETURN_83 4294967296)) (<= (mod v_xor_~res~0_BEFORE_RETURN_83 4294967296) 2147483647) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_612 4294967296) 2147483647) (= (mod v_prenex_612 4294967296) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (<= (mod v_xor_~res~0_BEFORE_RETURN_84 4294967296) 2147483647)) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (+ (mod v_xor_~res~0_BEFORE_RETURN_84 4294967296) (- 4294967296)) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (<= (mod v_prenex_611 4294967296) 2147483647)) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_prenex_611 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))))) (not (= main_~ret~0 main_~ret5~0))) (and (exists ((v_prenex_611 Int) (v_prenex_612 Int) (v_xor_~res~0_BEFORE_RETURN_83 Int) (v_xor_~res~0_BEFORE_RETURN_84 Int)) (or (and (= main_~ret5~0 (mod v_xor_~res~0_BEFORE_RETURN_83 4294967296)) (<= (mod v_xor_~res~0_BEFORE_RETURN_83 4294967296) 2147483647) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_612 4294967296) 2147483647) (= (mod v_prenex_612 4294967296) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (<= (mod v_xor_~res~0_BEFORE_RETURN_84 4294967296) 2147483647)) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (+ (mod v_xor_~res~0_BEFORE_RETURN_84 4294967296) (- 4294967296)) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (<= (mod v_prenex_611 4294967296) 2147483647)) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_prenex_611 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))))) (not (= main_~ret~0 main_~ret2~0)))) [2019-10-13 21:31:33,129 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 424#true [2019-10-13 21:31:33,130 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 313#true [2019-10-13 21:31:33,130 INFO L193 IcfgInterpreter]: Reachable states at location L33-1 satisfy 587#true [2019-10-13 21:31:33,130 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 560#true [2019-10-13 21:31:33,541 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:31:33,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-13 21:31:33,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256678655] [2019-10-13 21:31:33,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-13 21:31:33,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:31:33,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-13 21:31:33,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2019-10-13 21:31:33,544 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 40 states. [2019-10-13 21:31:36,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:31:36,210 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2019-10-13 21:31:36,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-13 21:31:36,210 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 49 [2019-10-13 21:31:36,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:31:36,211 INFO L225 Difference]: With dead ends: 68 [2019-10-13 21:31:36,212 INFO L226 Difference]: Without dead ends: 50 [2019-10-13 21:31:36,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1244, Invalid=4158, Unknown=0, NotChecked=0, Total=5402 [2019-10-13 21:31:36,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-13 21:31:36,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-10-13 21:31:36,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-13 21:31:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-10-13 21:31:36,223 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 49 [2019-10-13 21:31:36,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:31:36,224 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-10-13 21:31:36,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-13 21:31:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-10-13 21:31:36,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-13 21:31:36,225 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:31:36,226 INFO L380 BasicCegarLoop]: trace histogram [26, 12, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:31:36,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:31:36,430 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:31:36,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:31:36,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1795685774, now seen corresponding path program 5 times [2019-10-13 21:31:36,432 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:31:36,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20558227] [2019-10-13 21:31:36,432 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:36,433 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:36,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:31:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 21:31:36,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20558227] [2019-10-13 21:31:36,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280149756] [2019-10-13 21:31:36,948 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:31:37,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:31:37,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:31:37,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:31:37,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:31:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-13 21:31:37,182 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:31:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-10-13 21:31:37,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [82409259] [2019-10-13 21:31:37,285 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:31:37,285 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:31:37,286 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:31:37,286 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:31:37,286 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:31:37,300 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:31:38,535 INFO L199 IcfgInterpreter]: Interpreting procedure xor with input of size 1 for LOIs [2019-10-13 21:31:38,555 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:31:38,558 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:31:38,558 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:31:38,558 INFO L193 IcfgInterpreter]: Reachable states at location xorEXIT satisfy 644#(and (not (< xor_~i~0 100000)) (<= 1 xor_~i~0) (= (ite (<= (mod xor_~res~0 4294967296) 2147483647) (mod xor_~res~0 4294967296) (+ (mod xor_~res~0 4294967296) (- 4294967296))) |xor_#res|) (<= 100000 xor_~i~0)) [2019-10-13 21:31:38,558 INFO L193 IcfgInterpreter]: Reachable states at location L26-4 satisfy 73#(and (not (< main_~i~1 100000)) (<= 100000 main_~i~1)) [2019-10-13 21:31:38,559 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 592#(exists ((v_xor_~res~0_BEFORE_RETURN_105 Int) (v_prenex_777 Int) (v_xor_~res~0_BEFORE_RETURN_106 Int) (v_prenex_778 Int)) (or (and (not (<= (mod v_prenex_778 4294967296) 2147483647)) (not (< main_~i~1 100000)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= main_~ret~0 2147483647) (= (+ (mod v_prenex_778 4294967296) (- 4294967296)) main_~ret~0)) (and (not (<= (mod v_xor_~res~0_BEFORE_RETURN_105 4294967296) 2147483647)) (not (< main_~i~1 100000)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= main_~ret~0 2147483647) (= main_~ret~0 (+ (mod v_xor_~res~0_BEFORE_RETURN_105 4294967296) (- 4294967296)))) (and (<= (mod v_prenex_777 4294967296) 2147483647) (not (< main_~i~1 100000)) (= main_~ret~0 (mod v_prenex_777 4294967296)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= main_~ret~0 2147483647)) (and (<= (mod v_xor_~res~0_BEFORE_RETURN_106 4294967296) 2147483647) (not (< main_~i~1 100000)) (= main_~ret~0 (mod v_xor_~res~0_BEFORE_RETURN_106 4294967296)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= main_~ret~0 2147483647)))) [2019-10-13 21:31:38,559 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 648#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:31:38,559 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 68#true [2019-10-13 21:31:38,559 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 639#(<= 1 xor_~i~0) [2019-10-13 21:31:38,559 INFO L193 IcfgInterpreter]: Reachable states at location xorENTRY satisfy 601#true [2019-10-13 21:31:38,559 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:38,560 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-13 21:31:38,560 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 653#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:38,560 INFO L193 IcfgInterpreter]: Reachable states at location L39-1 satisfy 479#true [2019-10-13 21:31:38,560 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:31:38,560 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 522#(and (not (< main_~i~2 99999)) (<= 99999 main_~i~2) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) [2019-10-13 21:31:38,561 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 120#(or (exists ((v_xor_~res~0_BEFORE_RETURN_105 Int) (v_prenex_777 Int)) (or (and (not (< main_~i~1 100000)) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_105 4294967296) 2147483647)) (= (+ (mod v_xor_~res~0_BEFORE_RETURN_105 4294967296) (- 4294967296)) |main_#t~ret5|)) (and (<= (mod v_prenex_777 4294967296) 2147483647) (= (mod v_prenex_777 4294967296) |main_#t~ret5|) (not (< main_~i~1 100000))))) (exists ((v_xor_~res~0_BEFORE_RETURN_106 Int) (v_prenex_778 Int)) (or (and (= |main_#t~ret5| (+ (mod v_prenex_778 4294967296) (- 4294967296))) (not (<= (mod v_prenex_778 4294967296) 2147483647)) (not (< main_~i~1 100000))) (and (<= (mod v_xor_~res~0_BEFORE_RETURN_106 4294967296) 2147483647) (not (< main_~i~1 100000)) (= (mod v_xor_~res~0_BEFORE_RETURN_106 4294967296) |main_#t~ret5|))))) [2019-10-13 21:31:38,561 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (and (not (= main_~ret~0 main_~ret2~0)) (exists ((v_xor_~res~0_BEFORE_RETURN_109 Int) (v_prenex_806 Int) (v_xor_~res~0_BEFORE_RETURN_110 Int) (v_prenex_805 Int)) (or (and (not (<= (mod v_prenex_806 4294967296) 2147483647)) (= (+ (mod v_prenex_806 4294967296) (- 4294967296)) main_~ret5~0) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_xor_~res~0_BEFORE_RETURN_110 4294967296) 2147483647) (= (mod v_xor_~res~0_BEFORE_RETURN_110 4294967296) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (= (+ (mod v_xor_~res~0_BEFORE_RETURN_109 4294967296) (- 4294967296)) main_~ret5~0) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_109 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (= main_~ret5~0 (mod v_prenex_805 4294967296)) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_805 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996))))))) (and (exists ((v_xor_~res~0_BEFORE_RETURN_109 Int) (v_prenex_806 Int) (v_xor_~res~0_BEFORE_RETURN_110 Int) (v_prenex_805 Int)) (or (and (not (<= (mod v_prenex_806 4294967296) 2147483647)) (= (+ (mod v_prenex_806 4294967296) (- 4294967296)) main_~ret5~0) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_xor_~res~0_BEFORE_RETURN_110 4294967296) 2147483647) (= (mod v_xor_~res~0_BEFORE_RETURN_110 4294967296) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (= (+ (mod v_xor_~res~0_BEFORE_RETURN_109 4294967296) (- 4294967296)) main_~ret5~0) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_109 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (= main_~ret5~0 (mod v_prenex_805 4294967296)) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_805 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))))) (not (= main_~ret~0 main_~ret5~0)))) [2019-10-13 21:31:38,561 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 424#true [2019-10-13 21:31:38,561 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 313#true [2019-10-13 21:31:38,562 INFO L193 IcfgInterpreter]: Reachable states at location L33-1 satisfy 587#true [2019-10-13 21:31:38,562 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 560#true [2019-10-13 21:31:39,085 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:31:39,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 4, 4, 11] total 43 [2019-10-13 21:31:39,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98000794] [2019-10-13 21:31:39,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-13 21:31:39,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:31:39,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-13 21:31:39,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=1443, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 21:31:39,090 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 44 states. [2019-10-13 21:31:41,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:31:41,324 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-10-13 21:31:41,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-13 21:31:41,324 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2019-10-13 21:31:41,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:31:41,326 INFO L225 Difference]: With dead ends: 72 [2019-10-13 21:31:41,326 INFO L226 Difference]: Without dead ends: 54 [2019-10-13 21:31:41,328 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1349, Invalid=5457, Unknown=0, NotChecked=0, Total=6806 [2019-10-13 21:31:41,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-13 21:31:41,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-13 21:31:41,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-13 21:31:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-13 21:31:41,337 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 63 [2019-10-13 21:31:41,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:31:41,337 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-13 21:31:41,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-13 21:31:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-13 21:31:41,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-13 21:31:41,339 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:31:41,339 INFO L380 BasicCegarLoop]: trace histogram [27, 12, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:31:41,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:31:41,540 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:31:41,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:31:41,541 INFO L82 PathProgramCache]: Analyzing trace with hash -344788902, now seen corresponding path program 6 times [2019-10-13 21:31:41,541 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:31:41,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043043639] [2019-10-13 21:31:41,541 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:41,542 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:41,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:31:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-13 21:31:42,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043043639] [2019-10-13 21:31:42,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816902656] [2019-10-13 21:31:42,125 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:31:42,382 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:31:42,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:31:42,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 21:31:42,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:31:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-13 21:31:42,413 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:31:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-13 21:31:43,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [304629961] [2019-10-13 21:31:43,376 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 21:31:43,376 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:31:43,376 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:31:43,377 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:31:43,377 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:31:43,396 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:31:44,671 INFO L199 IcfgInterpreter]: Interpreting procedure xor with input of size 1 for LOIs [2019-10-13 21:31:44,692 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:31:44,695 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:31:44,695 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:31:44,695 INFO L193 IcfgInterpreter]: Reachable states at location xorEXIT satisfy 644#(and (not (< xor_~i~0 100000)) (<= 1 xor_~i~0) (= (ite (<= (mod xor_~res~0 4294967296) 2147483647) (mod xor_~res~0 4294967296) (+ (mod xor_~res~0 4294967296) (- 4294967296))) |xor_#res|) (<= 100000 xor_~i~0)) [2019-10-13 21:31:44,695 INFO L193 IcfgInterpreter]: Reachable states at location L26-4 satisfy 73#(and (not (< main_~i~1 100000)) (<= 100000 main_~i~1)) [2019-10-13 21:31:44,695 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 592#(exists ((v_prenex_972 Int) (v_prenex_971 Int) (v_xor_~res~0_BEFORE_RETURN_132 Int) (v_xor_~res~0_BEFORE_RETURN_131 Int)) (or (and (not (<= (mod v_prenex_971 4294967296) 2147483647)) (not (< main_~i~1 100000)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~0 (+ (mod v_prenex_971 4294967296) (- 4294967296))) (<= main_~ret~0 2147483647)) (and (= main_~ret~0 (mod v_prenex_972 4294967296)) (not (< main_~i~1 100000)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= main_~ret~0 2147483647) (<= (mod v_prenex_972 4294967296) 2147483647)) (and (= main_~ret~0 (mod v_xor_~res~0_BEFORE_RETURN_131 4294967296)) (not (< main_~i~1 100000)) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= main_~ret~0 2147483647) (<= (mod v_xor_~res~0_BEFORE_RETURN_131 4294967296) 2147483647)) (and (not (< main_~i~1 100000)) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_132 4294967296) 2147483647)) (= (+ (mod v_xor_~res~0_BEFORE_RETURN_132 4294967296) (- 4294967296)) main_~ret~0) (<= 0 (+ main_~ret~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= main_~ret~0 2147483647)))) [2019-10-13 21:31:44,696 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 648#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:31:44,696 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 68#true [2019-10-13 21:31:44,696 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 639#(<= 1 xor_~i~0) [2019-10-13 21:31:44,696 INFO L193 IcfgInterpreter]: Reachable states at location xorENTRY satisfy 601#true [2019-10-13 21:31:44,696 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:44,696 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:44,697 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 653#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:44,697 INFO L193 IcfgInterpreter]: Reachable states at location L39-1 satisfy 479#true [2019-10-13 21:31:44,697 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:31:44,697 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 522#(and (not (< main_~i~2 99999)) (<= 99999 main_~i~2) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) [2019-10-13 21:31:44,697 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 120#(or (exists ((v_prenex_972 Int) (v_xor_~res~0_BEFORE_RETURN_132 Int)) (or (and (not (< main_~i~1 100000)) (= (+ (mod v_xor_~res~0_BEFORE_RETURN_132 4294967296) (- 4294967296)) |main_#t~ret5|) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_132 4294967296) 2147483647))) (and (not (< main_~i~1 100000)) (= (mod v_prenex_972 4294967296) |main_#t~ret5|) (<= (mod v_prenex_972 4294967296) 2147483647)))) (exists ((v_prenex_971 Int) (v_xor_~res~0_BEFORE_RETURN_131 Int)) (or (and (not (< main_~i~1 100000)) (= |main_#t~ret5| (mod v_xor_~res~0_BEFORE_RETURN_131 4294967296)) (<= (mod v_xor_~res~0_BEFORE_RETURN_131 4294967296) 2147483647)) (and (not (<= (mod v_prenex_971 4294967296) 2147483647)) (not (< main_~i~1 100000)) (= |main_#t~ret5| (+ (mod v_prenex_971 4294967296) (- 4294967296))))))) [2019-10-13 21:31:44,698 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (and (exists ((v_prenex_1000 Int) (v_xor_~res~0_BEFORE_RETURN_136 Int) (v_xor_~res~0_BEFORE_RETURN_135 Int) (v_prenex_999 Int)) (or (and (= main_~ret5~0 (+ (mod v_xor_~res~0_BEFORE_RETURN_136 4294967296) (- 4294967296))) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_136 4294967296) 2147483647)) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (= (mod v_xor_~res~0_BEFORE_RETURN_135 4294967296) main_~ret5~0) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_xor_~res~0_BEFORE_RETURN_135 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (< main_~i~2 99999)) (<= (mod v_prenex_1000 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_prenex_1000 4294967296) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (<= (mod v_prenex_999 4294967296) 2147483647)) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (+ (mod v_prenex_999 4294967296) (- 4294967296)) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))))) (not (= main_~ret~0 main_~ret5~0))) (and (not (= main_~ret~0 main_~ret2~0)) (exists ((v_prenex_1000 Int) (v_xor_~res~0_BEFORE_RETURN_136 Int) (v_xor_~res~0_BEFORE_RETURN_135 Int) (v_prenex_999 Int)) (or (and (= main_~ret5~0 (+ (mod v_xor_~res~0_BEFORE_RETURN_136 4294967296) (- 4294967296))) (not (<= (mod v_xor_~res~0_BEFORE_RETURN_136 4294967296) 2147483647)) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (= (mod v_xor_~res~0_BEFORE_RETURN_135 4294967296) main_~ret5~0) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_xor_~res~0_BEFORE_RETURN_135 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (< main_~i~2 99999)) (<= (mod v_prenex_1000 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_prenex_1000 4294967296) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))) (and (not (<= (mod v_prenex_999 4294967296) 2147483647)) (not (< main_~i~2 99999)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (+ (mod v_prenex_999 4294967296) (- 4294967296)) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 399996)))))))) [2019-10-13 21:31:44,698 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 424#true [2019-10-13 21:31:44,698 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 313#true [2019-10-13 21:31:44,698 INFO L193 IcfgInterpreter]: Reachable states at location L33-1 satisfy 587#true [2019-10-13 21:31:44,698 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 560#true [2019-10-13 21:31:45,214 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:31:45,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-13 21:31:45,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455606970] [2019-10-13 21:31:45,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-13 21:31:45,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:31:45,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-13 21:31:45,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=3090, Unknown=0, NotChecked=0, Total=4830 [2019-10-13 21:31:45,218 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 70 states. [2019-10-13 21:31:48,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:31:48,511 INFO L93 Difference]: Finished difference Result 104 states and 140 transitions. [2019-10-13 21:31:48,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-13 21:31:48,511 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 67 [2019-10-13 21:31:48,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:31:48,512 INFO L225 Difference]: With dead ends: 104 [2019-10-13 21:31:48,512 INFO L226 Difference]: Without dead ends: 83 [2019-10-13 21:31:48,517 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3929 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5099, Invalid=12723, Unknown=0, NotChecked=0, Total=17822 [2019-10-13 21:31:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-13 21:31:48,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-10-13 21:31:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-13 21:31:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-10-13 21:31:48,527 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 67 [2019-10-13 21:31:48,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:31:48,527 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-10-13 21:31:48,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-13 21:31:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-10-13 21:31:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 21:31:48,529 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:31:48,529 INFO L380 BasicCegarLoop]: trace histogram [56, 12, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:31:48,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:31:48,736 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:31:48,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:31:48,737 INFO L82 PathProgramCache]: Analyzing trace with hash -303923653, now seen corresponding path program 7 times [2019-10-13 21:31:48,737 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:31:48,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918197689] [2019-10-13 21:31:48,738 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:48,738 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:48,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:31:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-13 21:31:50,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918197689] [2019-10-13 21:31:50,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347344963] [2019-10-13 21:31:50,067 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:31:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:50,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-13 21:31:50,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:31:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-13 21:31:50,368 INFO L321 TraceCheckSpWp]: Computing backward predicates...