./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a3cc8f4dc3627ca478516e9ddf056bcaabf24874a2c66b0dbc53cccb617610ef --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:21:47,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:21:47,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:21:47,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:21:47,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:21:47,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:21:47,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:21:47,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:21:47,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:21:47,630 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:21:47,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:21:47,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:21:47,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:21:47,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:21:47,633 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:21:47,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:21:47,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:21:47,634 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:21:47,634 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:21:47,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:21:47,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:21:47,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:21:47,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:21:47,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:21:47,640 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:21:47,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:21:47,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:21:47,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:21:47,641 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:21:47,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:21:47,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:21:47,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:21:47,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:21:47,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:21:47,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:21:47,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:21:47,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:21:47,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:21:47,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:21:47,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:21:47,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:21:47,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:21:47,646 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a3cc8f4dc3627ca478516e9ddf056bcaabf24874a2c66b0dbc53cccb617610ef [2024-10-24 09:21:47,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:21:47,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:21:47,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:21:47,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:21:47,947 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:21:47,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i [2024-10-24 09:21:49,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:21:49,600 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:21:49,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i [2024-10-24 09:21:49,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3fd583bf/86a70a5287a247608f34bd124c3d429d/FLAG39cce83f9 [2024-10-24 09:21:49,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3fd583bf/86a70a5287a247608f34bd124c3d429d [2024-10-24 09:21:49,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:21:49,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:21:49,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:21:49,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:21:49,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:21:49,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:21:49" (1/1) ... [2024-10-24 09:21:49,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136ff899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:49, skipping insertion in model container [2024-10-24 09:21:49,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:21:49" (1/1) ... [2024-10-24 09:21:50,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:21:50,199 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i[916,929] [2024-10-24 09:21:50,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:21:50,324 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:21:50,339 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i[916,929] [2024-10-24 09:21:50,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:21:50,401 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:21:50,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:50 WrapperNode [2024-10-24 09:21:50,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:21:50,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:21:50,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:21:50,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:21:50,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:50" (1/1) ... [2024-10-24 09:21:50,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:50" (1/1) ... [2024-10-24 09:21:50,469 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-10-24 09:21:50,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:21:50,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:21:50,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:21:50,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:21:50,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:50" (1/1) ... [2024-10-24 09:21:50,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:50" (1/1) ... [2024-10-24 09:21:50,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:50" (1/1) ... [2024-10-24 09:21:50,521 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:21:50,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:50" (1/1) ... [2024-10-24 09:21:50,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:50" (1/1) ... [2024-10-24 09:21:50,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:50" (1/1) ... [2024-10-24 09:21:50,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:50" (1/1) ... [2024-10-24 09:21:50,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:50" (1/1) ... [2024-10-24 09:21:50,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:50" (1/1) ... [2024-10-24 09:21:50,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:21:50,554 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:21:50,554 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:21:50,554 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:21:50,555 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:50" (1/1) ... [2024-10-24 09:21:50,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:21:50,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:21:50,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:21:50,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:21:50,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:21:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:21:50,650 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:21:50,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:21:50,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:21:50,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:21:50,752 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:21:50,755 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:21:51,322 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-24 09:21:51,323 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:21:51,381 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:21:51,381 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:21:51,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:21:51 BoogieIcfgContainer [2024-10-24 09:21:51,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:21:51,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:21:51,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:21:51,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:21:51,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:21:49" (1/3) ... [2024-10-24 09:21:51,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101126ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:21:51, skipping insertion in model container [2024-10-24 09:21:51,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:50" (2/3) ... [2024-10-24 09:21:51,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101126ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:21:51, skipping insertion in model container [2024-10-24 09:21:51,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:21:51" (3/3) ... [2024-10-24 09:21:51,393 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-87.i [2024-10-24 09:21:51,411 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:21:51,411 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:21:51,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:21:51,496 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@59d2efb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:21:51,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:21:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 09:21:51,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-24 09:21:51,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:21:51,523 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:21:51,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:21:51,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:21:51,530 INFO L85 PathProgramCache]: Analyzing trace with hash -59369122, now seen corresponding path program 1 times [2024-10-24 09:21:51,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:21:51,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79357194] [2024-10-24 09:21:51,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:21:51,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:21:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:51,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:21:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:51,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:21:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:51,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:21:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:51,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:21:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:51,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:21:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:51,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 09:21:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:51,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:21:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:51,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 09:21:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:21:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 09:21:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 09:21:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 09:21:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:21:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 09:21:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:21:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 09:21:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 09:21:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 09:21:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 09:21:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 09:21:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:21:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 09:21:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 09:21:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 09:21:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 09:21:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 09:21:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 09:21:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 09:21:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 09:21:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 09:21:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-24 09:21:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 09:21:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-24 09:21:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-24 09:21:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 09:21:52,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:21:52,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79357194] [2024-10-24 09:21:52,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79357194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:21:52,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:21:52,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:21:52,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632289479] [2024-10-24 09:21:52,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:21:52,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:21:52,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:21:52,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:21:52,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:21:52,215 INFO L87 Difference]: Start difference. First operand has 86 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-24 09:21:52,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:21:52,272 INFO L93 Difference]: Finished difference Result 169 states and 306 transitions. [2024-10-24 09:21:52,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:21:52,278 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 209 [2024-10-24 09:21:52,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:21:52,286 INFO L225 Difference]: With dead ends: 169 [2024-10-24 09:21:52,286 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 09:21:52,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:21:52,297 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:21:52,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:21:52,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 09:21:52,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 09:21:52,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 09:21:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 132 transitions. [2024-10-24 09:21:52,349 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 132 transitions. Word has length 209 [2024-10-24 09:21:52,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:21:52,350 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 132 transitions. [2024-10-24 09:21:52,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-24 09:21:52,350 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 132 transitions. [2024-10-24 09:21:52,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-24 09:21:52,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:21:52,355 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:21:52,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:21:52,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:21:52,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:21:52,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1802832602, now seen corresponding path program 1 times [2024-10-24 09:21:52,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:21:52,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236600234] [2024-10-24 09:21:52,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:21:52,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:21:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:21:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:21:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:21:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:21:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:21:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 09:21:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:21:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 09:21:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:21:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 09:21:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 09:21:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 09:21:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:21:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 09:21:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:21:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 09:21:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 09:21:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 09:21:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 09:21:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 09:21:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:21:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 09:21:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 09:21:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 09:21:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 09:21:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 09:21:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 09:21:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 09:21:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 09:21:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 09:21:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-24 09:21:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 09:21:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-24 09:21:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-24 09:21:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-24 09:21:53,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:21:53,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236600234] [2024-10-24 09:21:53,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236600234] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:21:53,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485840490] [2024-10-24 09:21:53,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:21:53,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:21:53,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:21:53,597 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) [2024-10-24 09:21:53,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 09:21:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:53,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 09:21:53,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:21:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1143 proven. 54 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2024-10-24 09:21:54,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:21:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-24 09:21:54,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485840490] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:21:54,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 09:21:54,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-24 09:21:54,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029742239] [2024-10-24 09:21:54,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 09:21:54,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 09:21:54,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:21:54,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 09:21:54,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:21:54,517 INFO L87 Difference]: Start difference. First operand 84 states and 132 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-10-24 09:21:54,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:21:54,825 INFO L93 Difference]: Finished difference Result 175 states and 270 transitions. [2024-10-24 09:21:54,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 09:21:54,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 209 [2024-10-24 09:21:54,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:21:54,832 INFO L225 Difference]: With dead ends: 175 [2024-10-24 09:21:54,833 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 09:21:54,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 482 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-24 09:21:54,837 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 59 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:21:54,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 203 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:21:54,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 09:21:54,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2024-10-24 09:21:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 09:21:54,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 134 transitions. [2024-10-24 09:21:54,865 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 134 transitions. Word has length 209 [2024-10-24 09:21:54,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:21:54,868 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 134 transitions. [2024-10-24 09:21:54,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-10-24 09:21:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 134 transitions. [2024-10-24 09:21:54,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-24 09:21:54,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:21:54,871 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:21:54,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 09:21:55,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:21:55,075 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:21:55,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:21:55,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1212271016, now seen corresponding path program 1 times [2024-10-24 09:21:55,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:21:55,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989230125] [2024-10-24 09:21:55,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:21:55,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:21:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:21:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:21:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:21:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:21:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:21:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 09:21:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:21:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 09:21:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:21:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 09:21:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 09:21:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 09:21:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:21:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 09:21:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:21:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 09:21:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 09:21:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 09:21:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 09:21:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 09:21:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:21:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 09:21:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 09:21:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 09:21:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 09:21:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 09:21:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 09:21:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 09:21:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 09:21:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 09:21:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-24 09:21:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 09:21:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-24 09:21:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-24 09:21:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 132 proven. 60 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2024-10-24 09:21:56,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:21:56,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989230125] [2024-10-24 09:21:56,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989230125] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:21:56,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944649282] [2024-10-24 09:21:56,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:21:56,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:21:56,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:21:56,464 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:21:56,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 09:21:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:56,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 09:21:56,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:21:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1229 proven. 60 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2024-10-24 09:21:56,981 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:21:57,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 132 proven. 63 refuted. 0 times theorem prover too weak. 2049 trivial. 0 not checked. [2024-10-24 09:21:57,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944649282] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:21:57,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 09:21:57,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 19 [2024-10-24 09:21:57,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922891691] [2024-10-24 09:21:57,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 09:21:57,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 09:21:57,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:21:57,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 09:21:57,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-10-24 09:21:57,426 INFO L87 Difference]: Start difference. First operand 88 states and 134 transitions. Second operand has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 4 states have call successors, (55), 3 states have call predecessors, (55), 7 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2024-10-24 09:21:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:21:58,606 INFO L93 Difference]: Finished difference Result 340 states and 497 transitions. [2024-10-24 09:21:58,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-24 09:21:58,606 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 4 states have call successors, (55), 3 states have call predecessors, (55), 7 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) Word has length 209 [2024-10-24 09:21:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:21:58,610 INFO L225 Difference]: With dead ends: 340 [2024-10-24 09:21:58,610 INFO L226 Difference]: Without dead ends: 253 [2024-10-24 09:21:58,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 477 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=1028, Unknown=0, NotChecked=0, Total=1406 [2024-10-24 09:21:58,613 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 544 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 09:21:58,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 539 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 09:21:58,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-24 09:21:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 217. [2024-10-24 09:21:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 132 states have internal predecessors, (164), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-24 09:21:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 320 transitions. [2024-10-24 09:21:58,656 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 320 transitions. Word has length 209 [2024-10-24 09:21:58,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:21:58,657 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 320 transitions. [2024-10-24 09:21:58,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 4 states have call successors, (55), 3 states have call predecessors, (55), 7 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2024-10-24 09:21:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 320 transitions. [2024-10-24 09:21:58,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-24 09:21:58,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:21:58,663 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:21:58,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 09:21:58,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-24 09:21:58,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:21:58,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:21:58,865 INFO L85 PathProgramCache]: Analyzing trace with hash -376076886, now seen corresponding path program 1 times [2024-10-24 09:21:58,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:21:58,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168031084] [2024-10-24 09:21:58,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:21:58,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:21:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:21:59,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1600849524] [2024-10-24 09:21:59,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:21:59,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:21:59,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:21:59,214 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:21:59,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 09:21:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:59,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-24 09:21:59,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:22:04,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1620 proven. 330 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2024-10-24 09:22:04,863 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:22:17,892 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (mod c_~var_1_8~0 256))) (let ((.cse5 (= (mod c_~var_1_22~0 c_~var_1_6~0) 0)) (.cse6 (div c_~var_1_22~0 c_~var_1_6~0)) (.cse7 (+ c_~var_1_22~0 1 .cse15)) (.cse1 (+ c_~var_1_22~0 .cse15)) (.cse3 (< c_~var_1_22~0 0)) (.cse0 (mod c_~var_1_18~0 65536))) (and (forall ((v_z_99 Int) (v_y_99 Int)) (let ((.cse2 (* v_y_99 100))) (or (< 0 (+ v_y_99 2 .cse0)) (< .cse1 (+ (div c_~var_1_22~0 (+ v_z_99 .cse2)) 1)) (< c_~var_1_6~0 (+ v_z_99 1 .cse2)) (< v_z_99 0) (< 99 v_z_99)))) (or (< 0 (+ c_~var_1_6~0 (* .cse0 100) 100)) (let ((.cse4 (< .cse1 .cse6))) (and (or .cse3 .cse4) (or .cse4 (not .cse5)) (<= .cse1 .cse6)))) (or .cse5 (< .cse7 .cse6) (< 0 (+ c_~var_1_6~0 1))) (forall ((v_y_95 Int)) (let ((.cse8 (* v_y_95 100))) (or (< c_~var_1_6~0 (+ .cse8 1)) (< 0 (+ v_y_95 .cse0 1)) (< .cse1 (div c_~var_1_22~0 .cse8)) (not (= (mod c_~var_1_22~0 .cse8) 0))))) (forall ((v_y_93 Int)) (let ((.cse9 (* v_y_93 100))) (or (< 0 (+ v_y_93 .cse0 1)) (< c_~var_1_6~0 (+ .cse9 1)) (= (mod c_~var_1_22~0 .cse9) 0) (< .cse7 (div c_~var_1_22~0 .cse9))))) (forall ((v_y_98 Int)) (let ((.cse10 (* v_y_98 100))) (or (< c_~var_1_6~0 (+ .cse10 1)) (< 0 (+ v_y_98 .cse0 1)) (< .cse1 (+ (div c_~var_1_22~0 .cse10) 1))))) (forall ((v_y_91 Int) (v_z_91 Int)) (let ((.cse12 (* v_y_91 100))) (let ((.cse11 (+ .cse12 v_z_91))) (or (< .cse7 (div c_~var_1_22~0 .cse11)) (= (mod c_~var_1_22~0 .cse11) 0) (< 0 (+ v_y_91 2 .cse0)) (< 99 v_z_91) (< v_z_91 0) (< c_~var_1_6~0 (+ .cse12 v_z_91 1)))))) (forall ((v_z_96 Int) (v_y_96 Int)) (let ((.cse14 (* v_y_96 100))) (let ((.cse13 (+ .cse14 v_z_96))) (or (< 99 v_z_96) (< v_z_96 0) (not (= (mod c_~var_1_22~0 .cse13) 0)) (< c_~var_1_6~0 (+ .cse14 v_z_96 1)) (< 0 (+ v_y_96 2 .cse0)) (< .cse1 (div c_~var_1_22~0 .cse13)))))) (or .cse3 (and (forall ((v_z_102 Int) (v_y_102 Int)) (or (< v_z_102 0) (< 0 (+ 2 v_y_102 .cse0)) (< 99 v_z_102) (< c_~var_1_6~0 (+ (* v_y_102 100) v_z_102 1)))) (forall ((v_y_101 Int)) (or (< 0 (+ v_y_101 .cse0 1)) (< c_~var_1_6~0 (+ (* v_y_101 100) 1))))))))) is different from false [2024-10-24 09:22:18,235 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (mod c_~var_1_8~0 256))) (let ((.cse2 (+ c_~var_1_22~0 1 .cse8)) (.cse4 (div c_~var_1_22~0 c_~var_1_6~0)) (.cse0 (mod c_~var_1_18~0 65536)) (.cse1 (+ c_~var_1_22~0 .cse8))) (and (forall ((v_z_99 Int) (v_y_99 Int)) (or (< 0 (+ v_y_99 2 .cse0)) (< .cse1 (+ (div c_~var_1_22~0 (+ v_z_99 (* v_y_99 100))) 1)) (< v_z_99 0) (< 99 v_z_99))) (<= (+ c_~var_1_22~0 1) 0) (forall ((v_y_91 Int) (v_z_91 Int)) (let ((.cse3 (+ (* v_y_91 100) v_z_91))) (or (< .cse2 (div c_~var_1_22~0 .cse3)) (= (mod c_~var_1_22~0 .cse3) 0) (< 0 (+ v_y_91 2 .cse0)) (< 99 v_z_91) (< v_z_91 0)))) (or (< 0 (+ c_~var_1_6~0 (* .cse0 100) 100)) (< .cse1 .cse4)) (forall ((v_z_96 Int) (v_y_96 Int)) (let ((.cse5 (+ (* v_y_96 100) v_z_96))) (or (< 99 v_z_96) (< v_z_96 0) (not (= (mod c_~var_1_22~0 .cse5) 0)) (< 0 (+ v_y_96 2 .cse0)) (< .cse1 (div c_~var_1_22~0 .cse5))))) (forall ((v_y_93 Int)) (let ((.cse6 (* v_y_93 100))) (or (< 0 (+ v_y_93 .cse0 1)) (= (mod c_~var_1_22~0 .cse6) 0) (< .cse2 (div c_~var_1_22~0 .cse6))))) (or (= (mod c_~var_1_22~0 c_~var_1_6~0) 0) (< .cse2 .cse4) (< 0 (+ c_~var_1_6~0 1))) (forall ((v_y_95 Int)) (let ((.cse7 (* v_y_95 100))) (or (< 0 (+ v_y_95 .cse0 1)) (< .cse1 (div c_~var_1_22~0 .cse7)) (not (= (mod c_~var_1_22~0 .cse7) 0))))) (forall ((v_y_98 Int)) (or (< 0 (+ v_y_98 .cse0 1)) (< .cse1 (+ (div c_~var_1_22~0 (* v_y_98 100)) 1))))))) is different from false [2024-10-24 09:22:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 09:22:42,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:22:42,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168031084] [2024-10-24 09:22:42,912 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 09:22:42,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600849524] [2024-10-24 09:22:42,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600849524] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 09:22:42,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 09:22:42,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [32] total 39 [2024-10-24 09:22:42,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418932638] [2024-10-24 09:22:42,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:22:42,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 09:22:42,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:22:42,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 09:22:42,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1090, Unknown=6, NotChecked=142, Total=1482 [2024-10-24 09:22:42,916 INFO L87 Difference]: Start difference. First operand 217 states and 320 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 09:22:47,193 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~var_1_8~0 256))) (let ((.cse14 (= (mod c_~var_1_22~0 c_~var_1_6~0) 0)) (.cse13 (div c_~var_1_22~0 c_~var_1_6~0)) (.cse24 (+ c_~var_1_22~0 .cse1)) (.cse10 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse36 (+ c_~var_1_22~0 1 .cse1)) (.cse6 (div c_~var_1_22~0 c_~var_1_5~0)) (.cse37 (+ c_~var_1_5~0 1))) (let ((.cse9 (< 0 .cse37)) (.cse28 (< .cse36 .cse6)) (.cse3 (not .cse10)) (.cse30 (< .cse24 .cse6)) (.cse12 (< c_~var_1_6~0 .cse37)) (.cse33 (< .cse36 .cse13)) (.cse15 (< 0 (+ c_~var_1_6~0 1))) (.cse19 (< c_~var_1_5~0 c_~var_1_6~0)) (.cse7 (< c_~var_1_22~0 0)) (.cse23 (< .cse24 .cse13)) (.cse21 (not .cse14)) (.cse35 (mod c_~var_1_28~0 65536))) (let ((.cse8 (< 0 (+ c_~var_1_22~0 1))) (.cse11 (+ c_~var_1_25~0 c_~var_1_22~0 1)) (.cse5 (+ c_~var_1_25~0 c_~var_1_22~0)) (.cse26 (+ .cse35 c_~var_1_22~0)) (.cse27 (+ .cse35 c_~var_1_22~0 1)) (.cse2 (mod (+ 34932 c_~var_1_29~0 .cse1) 65536)) (.cse16 (and (or (and (or .cse9 .cse10 .cse28) (or .cse30 .cse3) (or .cse30 .cse7) (<= .cse24 .cse6)) .cse12) (or .cse14 .cse33 .cse15) (or .cse19 (and (or .cse7 .cse23) (or .cse23 .cse21) (<= .cse24 .cse13))))) (.cse0 (mod c_~var_1_18~0 65536))) (and (forall ((v_~var_1_22~0_16 Int)) (or (forall ((v_z_99 Int) (v_y_99 Int)) (or (< 0 (+ v_y_99 2 .cse0)) (< (+ v_~var_1_22~0_16 .cse1) (+ (div v_~var_1_22~0_16 (+ v_z_99 (* v_y_99 100))) 1)) (< v_z_99 0) (< 99 v_z_99))) (< .cse2 (+ 65536 v_~var_1_22~0_16)))) (or (let ((.cse4 (< .cse5 .cse6))) (and (or .cse3 .cse4) (<= .cse5 .cse6) (or .cse4 .cse7) (or .cse8 .cse9 .cse10 (< .cse11 .cse6)))) .cse12) (forall ((v_~var_1_22~0_16 Int)) (or (forall ((v_y_98 Int)) (or (< 0 (+ v_y_98 .cse0 1)) (< (+ v_~var_1_22~0_16 .cse1) (+ (div v_~var_1_22~0_16 (* v_y_98 100)) 1)))) (< .cse2 (+ 65536 v_~var_1_22~0_16)))) (or .cse8 (< .cse11 .cse13) .cse14 .cse15) (or (< (mod c_~var_1_28~0 4294967296) (+ 1 .cse1)) .cse16) (forall ((v_~var_1_22~0_16 Int)) (or (forall ((v_z_96 Int) (v_y_96 Int)) (let ((.cse17 (+ (* v_y_96 100) v_z_96))) (or (< 99 v_z_96) (< v_z_96 0) (not (= (mod v_~var_1_22~0_16 .cse17) 0)) (< 0 (+ v_y_96 2 .cse0)) (< (+ v_~var_1_22~0_16 .cse1) (div v_~var_1_22~0_16 .cse17))))) (< .cse2 (+ 65536 v_~var_1_22~0_16)))) (forall ((v_~var_1_22~0_16 Int)) (or (forall ((v_y_91 Int) (v_z_91 Int)) (let ((.cse18 (+ (* v_y_91 100) v_z_91))) (or (< 0 (+ v_y_91 2 .cse0)) (< 99 v_z_91) (< v_z_91 0) (= (mod v_~var_1_22~0_16 .cse18) 0) (< (+ v_~var_1_22~0_16 1 .cse1) (div v_~var_1_22~0_16 .cse18))))) (< .cse2 (+ 65536 v_~var_1_22~0_16)))) (or .cse19 (let ((.cse20 (< .cse5 .cse13))) (and (or .cse20 .cse21) (or .cse20 .cse7) (<= .cse5 .cse13)))) (or (forall ((v_~var_1_22~0_16 Int)) (or (= (mod v_~var_1_22~0_16 c_~var_1_6~0) 0) (< (+ v_~var_1_22~0_16 1 .cse1) (div v_~var_1_22~0_16 c_~var_1_6~0)) (< .cse2 (+ 65536 v_~var_1_22~0_16)))) .cse15) (or .cse19 (let ((.cse22 (< .cse26 .cse13))) (and (or .cse22 .cse23 .cse21) (or .cse22 .cse7 .cse23) (let ((.cse25 (+ .cse13 1))) (or (< .cse24 .cse25) (< .cse26 .cse25)))))) (or (let ((.cse31 (< .cse26 .cse6))) (and (or (< .cse27 .cse6) .cse9 .cse10 .cse28) (let ((.cse29 (+ .cse6 1))) (or (< .cse26 .cse29) (< .cse24 .cse29))) (or .cse30 .cse3 .cse31) (or .cse30 .cse7 .cse31))) .cse12) (or (forall ((v_~var_1_22~0_16 Int)) (or (< (+ v_~var_1_22~0_16 .cse1) (div v_~var_1_22~0_16 c_~var_1_6~0)) (< .cse2 (+ 65536 v_~var_1_22~0_16)))) (< 0 (+ c_~var_1_6~0 (* .cse0 100) 100))) (forall ((v_~var_1_22~0_16 Int)) (or (forall ((v_y_95 Int)) (let ((.cse32 (* v_y_95 100))) (or (not (= (mod v_~var_1_22~0_16 .cse32) 0)) (< 0 (+ v_y_95 .cse0 1)) (< (+ v_~var_1_22~0_16 .cse1) (div v_~var_1_22~0_16 .cse32))))) (< .cse2 (+ 65536 v_~var_1_22~0_16)))) (or .cse14 .cse33 (< .cse27 .cse13) .cse15) (forall ((v_~var_1_22~0_16 Int)) (or (forall ((v_y_93 Int)) (let ((.cse34 (* v_y_93 100))) (or (= (mod v_~var_1_22~0_16 .cse34) 0) (< 0 (+ v_y_93 .cse0 1)) (< (+ v_~var_1_22~0_16 1 .cse1) (div v_~var_1_22~0_16 .cse34))))) (< .cse2 (+ 65536 v_~var_1_22~0_16)))) (<= 32768 .cse2) (or .cse16 (< |c_ULTIMATE.start_step_~stepLocal_5~0#1| (+ .cse0 1)))))))) is different from false [2024-10-24 09:22:52,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-10-24 09:22:56,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-10-24 09:22:56,665 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_18~0 65536)) (.cse1 (mod c_~var_1_8~0 256))) (let ((.cse4 (+ c_~var_1_22~0 1 .cse1)) (.cse8 (div c_~var_1_22~0 c_~var_1_6~0)) (.cse12 (< 0 (+ c_~var_1_6~0 1))) (.cse7 (< 0 (+ c_~var_1_6~0 (* .cse0 100) 100))) (.cse2 (mod (+ 34932 c_~var_1_29~0 .cse1) 65536)) (.cse3 (+ c_~var_1_22~0 .cse1))) (and (forall ((v_~var_1_22~0_16 Int)) (or (forall ((v_z_99 Int) (v_y_99 Int)) (or (< 0 (+ v_y_99 2 .cse0)) (< (+ v_~var_1_22~0_16 .cse1) (+ (div v_~var_1_22~0_16 (+ v_z_99 (* v_y_99 100))) 1)) (< v_z_99 0) (< 99 v_z_99))) (< .cse2 (+ 65536 v_~var_1_22~0_16)))) (forall ((v_z_99 Int) (v_y_99 Int)) (or (< 0 (+ v_y_99 2 .cse0)) (< .cse3 (+ (div c_~var_1_22~0 (+ v_z_99 (* v_y_99 100))) 1)) (< v_z_99 0) (< 99 v_z_99))) (forall ((v_~var_1_22~0_16 Int)) (or (forall ((v_y_98 Int)) (or (< 0 (+ v_y_98 .cse0 1)) (< (+ v_~var_1_22~0_16 .cse1) (+ (div v_~var_1_22~0_16 (* v_y_98 100)) 1)))) (< .cse2 (+ 65536 v_~var_1_22~0_16)))) (<= (+ c_~var_1_22~0 1) 0) (forall ((v_y_91 Int) (v_z_91 Int)) (let ((.cse5 (+ (* v_y_91 100) v_z_91))) (or (< .cse4 (div c_~var_1_22~0 .cse5)) (= (mod c_~var_1_22~0 .cse5) 0) (< 0 (+ v_y_91 2 .cse0)) (< 99 v_z_91) (< v_z_91 0)))) (forall ((v_~var_1_22~0_16 Int)) (or (forall ((v_z_96 Int) (v_y_96 Int)) (let ((.cse6 (+ (* v_y_96 100) v_z_96))) (or (< 99 v_z_96) (< v_z_96 0) (not (= (mod v_~var_1_22~0_16 .cse6) 0)) (< 0 (+ v_y_96 2 .cse0)) (< (+ v_~var_1_22~0_16 .cse1) (div v_~var_1_22~0_16 .cse6))))) (< .cse2 (+ 65536 v_~var_1_22~0_16)))) (or .cse7 (< .cse3 .cse8)) (forall ((v_~var_1_22~0_16 Int)) (or (forall ((v_y_91 Int) (v_z_91 Int)) (let ((.cse9 (+ (* v_y_91 100) v_z_91))) (or (< 0 (+ v_y_91 2 .cse0)) (< 99 v_z_91) (< v_z_91 0) (= (mod v_~var_1_22~0_16 .cse9) 0) (< (+ v_~var_1_22~0_16 1 .cse1) (div v_~var_1_22~0_16 .cse9))))) (< .cse2 (+ 65536 v_~var_1_22~0_16)))) (forall ((v_z_96 Int) (v_y_96 Int)) (let ((.cse10 (+ (* v_y_96 100) v_z_96))) (or (< 99 v_z_96) (< v_z_96 0) (not (= (mod c_~var_1_22~0 .cse10) 0)) (< 0 (+ v_y_96 2 .cse0)) (< .cse3 (div c_~var_1_22~0 .cse10))))) (forall ((v_y_93 Int)) (let ((.cse11 (* v_y_93 100))) (or (< 0 (+ v_y_93 .cse0 1)) (= (mod c_~var_1_22~0 .cse11) 0) (< .cse4 (div c_~var_1_22~0 .cse11))))) (or (= (mod c_~var_1_22~0 c_~var_1_6~0) 0) (< .cse4 .cse8) .cse12) (or (forall ((v_~var_1_22~0_16 Int)) (or (= (mod v_~var_1_22~0_16 c_~var_1_6~0) 0) (< (+ v_~var_1_22~0_16 1 .cse1) (div v_~var_1_22~0_16 c_~var_1_6~0)) (< .cse2 (+ 65536 v_~var_1_22~0_16)))) .cse12) (or (forall ((v_~var_1_22~0_16 Int)) (or (< (+ v_~var_1_22~0_16 .cse1) (div v_~var_1_22~0_16 c_~var_1_6~0)) (< .cse2 (+ 65536 v_~var_1_22~0_16)))) .cse7) (forall ((v_y_95 Int)) (let ((.cse13 (* v_y_95 100))) (or (< 0 (+ v_y_95 .cse0 1)) (< .cse3 (div c_~var_1_22~0 .cse13)) (not (= (mod c_~var_1_22~0 .cse13) 0))))) (forall ((v_~var_1_22~0_16 Int)) (or (forall ((v_y_95 Int)) (let ((.cse14 (* v_y_95 100))) (or (not (= (mod v_~var_1_22~0_16 .cse14) 0)) (< 0 (+ v_y_95 .cse0 1)) (< (+ v_~var_1_22~0_16 .cse1) (div v_~var_1_22~0_16 .cse14))))) (< .cse2 (+ 65536 v_~var_1_22~0_16)))) (forall ((v_~var_1_22~0_16 Int)) (or (forall ((v_y_93 Int)) (let ((.cse15 (* v_y_93 100))) (or (= (mod v_~var_1_22~0_16 .cse15) 0) (< 0 (+ v_y_93 .cse0 1)) (< (+ v_~var_1_22~0_16 1 .cse1) (div v_~var_1_22~0_16 .cse15))))) (< .cse2 (+ 65536 v_~var_1_22~0_16)))) (<= 32768 .cse2) (forall ((v_y_98 Int)) (or (< 0 (+ v_y_98 .cse0 1)) (< .cse3 (+ (div c_~var_1_22~0 (* v_y_98 100)) 1))))))) is different from false [2024-10-24 09:23:18,068 WARN L286 SmtUtils]: Spent 5.43s on a formula simplification. DAG size of input: 131 DAG size of output: 131 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)