/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:43:28,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:43:28,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:43:28,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:43:28,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:43:28,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:43:28,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:43:28,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:43:28,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:43:28,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:43:28,430 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:43:28,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:43:28,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:43:28,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:43:28,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:43:28,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:43:28,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:43:28,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:43:28,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:43:28,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:43:28,436 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:43:28,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:43:28,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:43:28,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:43:28,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:43:28,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:43:28,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:43:28,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:43:28,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:43:28,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:43:28,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:43:28,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:43:28,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:43:28,448 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:43:28,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:43:28,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:43:28,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:43:28,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:43:28,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:43:28,449 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:43:28,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:43:28,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:43:28,451 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:43:28,458 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:43:28,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:43:28,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:43:28,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:43:28,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:43:28,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:43:28,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:43:28,460 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:43:28,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:43:28,461 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:43:28,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:43:28,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:43:28,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:43:28,461 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:43:28,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:43:28,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:43:28,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:43:28,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:43:28,462 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:43:28,462 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:43:28,462 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:43:28,462 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:43:28,462 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:43:28,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:43:28,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:43:28,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:43:28,661 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:43:28,662 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:43:28,663 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+cfa-reducer.c [2022-04-15 12:43:28,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c1382dbf/3d39ad8e5226444ebc7ad20132abed48/FLAGb5e018c25 [2022-04-15 12:43:29,050 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:43:29,051 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+cfa-reducer.c [2022-04-15 12:43:29,055 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c1382dbf/3d39ad8e5226444ebc7ad20132abed48/FLAGb5e018c25 [2022-04-15 12:43:29,064 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c1382dbf/3d39ad8e5226444ebc7ad20132abed48 [2022-04-15 12:43:29,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:43:29,067 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:43:29,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:43:29,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:43:29,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:43:29,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:43:29" (1/1) ... [2022-04-15 12:43:29,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2099cda9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:43:29, skipping insertion in model container [2022-04-15 12:43:29,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:43:29" (1/1) ... [2022-04-15 12:43:29,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:43:29,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:43:29,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+cfa-reducer.c[1250,1263] [2022-04-15 12:43:29,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:43:29,220 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:43:29,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+cfa-reducer.c[1250,1263] [2022-04-15 12:43:29,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:43:29,239 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:43:29,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:43:29 WrapperNode [2022-04-15 12:43:29,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:43:29,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:43:29,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:43:29,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:43:29,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:43:29" (1/1) ... [2022-04-15 12:43:29,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:43:29" (1/1) ... [2022-04-15 12:43:29,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:43:29" (1/1) ... [2022-04-15 12:43:29,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:43:29" (1/1) ... [2022-04-15 12:43:29,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:43:29" (1/1) ... [2022-04-15 12:43:29,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:43:29" (1/1) ... [2022-04-15 12:43:29,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:43:29" (1/1) ... [2022-04-15 12:43:29,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:43:29,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:43:29,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:43:29,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:43:29,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:43:29" (1/1) ... [2022-04-15 12:43:29,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:43:29,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:43:29,313 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:43:29,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:43:29,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:43:29,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:43:29,339 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:43:29,339 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:43:29,340 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:43:29,340 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:43:29,340 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:43:29,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:43:29,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:43:29,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:43:29,341 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:43:29,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:43:29,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:43:29,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:43:29,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:43:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:43:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:43:29,388 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:43:29,389 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:43:33,876 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:43:33,881 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:43:33,881 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-15 12:43:33,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:43:33 BoogieIcfgContainer [2022-04-15 12:43:33,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:43:33,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:43:33,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:43:33,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:43:33,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:43:29" (1/3) ... [2022-04-15 12:43:33,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f98d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:43:33, skipping insertion in model container [2022-04-15 12:43:33,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:43:29" (2/3) ... [2022-04-15 12:43:33,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f98d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:43:33, skipping insertion in model container [2022-04-15 12:43:33,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:43:33" (3/3) ... [2022-04-15 12:43:33,893 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c.v+cfa-reducer.c [2022-04-15 12:43:33,896 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:43:33,896 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:43:33,957 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:43:33,962 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:43:33,962 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:43:33,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:43:33,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:43:33,996 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:43:33,997 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:43:33,998 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:43:34,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:43:34,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1410293457, now seen corresponding path program 1 times [2022-04-15 12:43:34,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:43:34,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [188683952] [2022-04-15 12:43:34,020 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:43:34,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1410293457, now seen corresponding path program 2 times [2022-04-15 12:43:34,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:43:34,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598083273] [2022-04-15 12:43:34,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:43:34,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:43:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:43:34,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:43:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:43:34,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_107~0)| ~__return_107~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_107~0 := 0; {22#true} is VALID [2022-04-15 12:43:34,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 12:43:34,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #43#return; {22#true} is VALID [2022-04-15 12:43:34,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {28#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_107~0)| ~__return_107~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:43:34,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_107~0)| ~__return_107~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_107~0 := 0; {22#true} is VALID [2022-04-15 12:43:34,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 12:43:34,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #43#return; {22#true} is VALID [2022-04-15 12:43:34,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret7 := main(); {22#true} is VALID [2022-04-15 12:43:34,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {27#(= (+ (- 1) main_~main__y~0) 0)} is VALID [2022-04-15 12:43:34,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#(= (+ (- 1) main_~main__y~0) 0)} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {27#(= (+ (- 1) main_~main__y~0) 0)} is VALID [2022-04-15 12:43:34,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#(= (+ (- 1) main_~main__y~0) 0)} assume !!(0 == ~main____CPAchecker_TMP_0~0); {27#(= (+ (- 1) main_~main__y~0) 0)} is VALID [2022-04-15 12:43:34,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#(= (+ (- 1) main_~main__y~0) 0)} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {23#false} is VALID [2022-04-15 12:43:34,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~__VERIFIER_assert__cond~0; {23#false} is VALID [2022-04-15 12:43:34,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-15 12:43:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:43:34,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:43:34,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598083273] [2022-04-15 12:43:34,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598083273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:43:34,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:43:34,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:43:34,248 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:43:34,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [188683952] [2022-04-15 12:43:34,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [188683952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:43:34,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:43:34,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:43:34,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452269301] [2022-04-15 12:43:34,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:43:34,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:43:34,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:43:34,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:43:34,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:43:34,272 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:43:34,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:43:34,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:43:34,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:43:34,289 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:43:38,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:43:42,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:43:45,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:43:47,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:43:47,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:43:47,494 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-15 12:43:47,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:43:47,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:43:47,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:43:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:43:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-15 12:43:47,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:43:47,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-15 12:43:47,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-04-15 12:43:47,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:43:47,572 INFO L225 Difference]: With dead ends: 36 [2022-04-15 12:43:47,573 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 12:43:47,575 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:43:47,580 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:43:47,584 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 31 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 8.1s Time] [2022-04-15 12:43:47,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 12:43:47,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-04-15 12:43:47,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:43:47,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:43:47,613 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:43:47,613 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:43:47,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:43:47,618 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-04-15 12:43:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-04-15 12:43:47,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:43:47,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:43:47,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:43:47,619 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:43:47,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:43:47,621 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-04-15 12:43:47,621 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-04-15 12:43:47,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:43:47,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:43:47,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:43:47,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:43:47,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:43:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-15 12:43:47,625 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2022-04-15 12:43:47,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:43:47,625 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-15 12:43:47,626 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:43:47,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 20 transitions. [2022-04-15 12:43:47,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:43:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-15 12:43:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:43:47,653 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:43:47,657 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:43:47,658 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:43:47,658 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:43:47,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:43:47,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1346650520, now seen corresponding path program 1 times [2022-04-15 12:43:47,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:43:47,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1225586737] [2022-04-15 12:43:47,663 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:43:47,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1346650520, now seen corresponding path program 2 times [2022-04-15 12:43:47,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:43:47,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615223905] [2022-04-15 12:43:47,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:43:47,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:43:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:43:48,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:43:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:43:48,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {187#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_107~0)| ~__return_107~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_107~0 := 0; {179#true} is VALID [2022-04-15 12:43:48,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#true} assume true; {179#true} is VALID [2022-04-15 12:43:48,011 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {179#true} {179#true} #43#return; {179#true} is VALID [2022-04-15 12:43:48,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {179#true} call ULTIMATE.init(); {187#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_107~0)| ~__return_107~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:43:48,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {187#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_107~0)| ~__return_107~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_107~0 := 0; {179#true} is VALID [2022-04-15 12:43:48,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#true} assume true; {179#true} is VALID [2022-04-15 12:43:48,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179#true} {179#true} #43#return; {179#true} is VALID [2022-04-15 12:43:48,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {179#true} call #t~ret7 := main(); {179#true} is VALID [2022-04-15 12:43:48,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {179#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {184#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-15 12:43:48,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {184#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {184#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-15 12:43:48,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {184#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} assume !(0 == ~main____CPAchecker_TMP_0~0); {184#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-15 12:43:50,120 WARN L290 TraceCheckUtils]: 8: Hoare triple {184#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} assume 1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296;~main__x~0 := 2 + ~main__x~0;~main__y~0 := 0; {185#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-15 12:43:50,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {185#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {185#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:43:50,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {185#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume !!(0 == ~main____CPAchecker_TMP_0~0); {185#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:43:50,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {185#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {186#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 12:43:50,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {186#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {180#false} is VALID [2022-04-15 12:43:50,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {180#false} assume !false; {180#false} is VALID [2022-04-15 12:43:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:43:50,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:43:50,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615223905] [2022-04-15 12:43:50,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615223905] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:43:50,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68344369] [2022-04-15 12:43:50,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:43:50,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:43:50,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:43:50,130 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:43:50,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process