./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-?-c7c6ca5-m [2024-11-08 23:36:32,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:36:32,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:36:32,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:36:32,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:36:32,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:36:32,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:36:32,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:36:32,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:36:32,180 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:36:32,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:36:32,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:36:32,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:36:32,181 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:36:32,182 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:36:32,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:36:32,182 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:36:32,183 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:36:32,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:36:32,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:36:32,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:36:32,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:36:32,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:36:32,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:36:32,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:36:32,190 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:36:32,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:36:32,190 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:36:32,190 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:36:32,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:36:32,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:36:32,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:36:32,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:36:32,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:36:32,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:36:32,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:36:32,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:36:32,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:36:32,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:36:32,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:36:32,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:36:32,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:36:32,197 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-11-08 23:36:32,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:36:32,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:36:32,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:36:32,471 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:36:32,471 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:36:32,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i [2024-11-08 23:36:33,962 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:36:34,195 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:36:34,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i [2024-11-08 23:36:34,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a98776d0/7f5cb955d17b46db8a79c674b95c5a75/FLAG02abd1459 [2024-11-08 23:36:34,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a98776d0/7f5cb955d17b46db8a79c674b95c5a75 [2024-11-08 23:36:34,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:36:34,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:36:34,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:36:34,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:36:34,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:36:34,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:36:34" (1/1) ... [2024-11-08 23:36:34,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d17d2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:36:34, skipping insertion in model container [2024-11-08 23:36:34,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:36:34" (1/1) ... [2024-11-08 23:36:34,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:36:34,747 WARN L250 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-11-08 23:36:34,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:36:34,858 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:36:34,869 WARN L250 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-11-08 23:36:34,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:36:34,933 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:36:34,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:36:34 WrapperNode [2024-11-08 23:36:34,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:36:34,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:36:34,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:36:34,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:36:34,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:36:34" (1/1) ... [2024-11-08 23:36:34,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:36:34" (1/1) ... [2024-11-08 23:36:35,019 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-11-08 23:36:35,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:36:35,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:36:35,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:36:35,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:36:35,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:36:34" (1/1) ... [2024-11-08 23:36:35,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:36:34" (1/1) ... [2024-11-08 23:36:35,037 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:36:34" (1/1) ... [2024-11-08 23:36:35,068 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-11-08 23:36:35,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:36:34" (1/1) ... [2024-11-08 23:36:35,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:36:34" (1/1) ... [2024-11-08 23:36:35,092 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:36:34" (1/1) ... [2024-11-08 23:36:35,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:36:34" (1/1) ... [2024-11-08 23:36:35,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:36:34" (1/1) ... [2024-11-08 23:36:35,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:36:34" (1/1) ... [2024-11-08 23:36:35,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:36:35,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:36:35,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:36:35,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:36:35,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:36:34" (1/1) ... [2024-11-08 23:36:35,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:36:35,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:36:35,160 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-11-08 23:36:35,164 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-11-08 23:36:35,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:36:35,217 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:36:35,217 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:36:35,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:36:35,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:36:35,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:36:35,312 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:36:35,314 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:36:35,912 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-08 23:36:35,913 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:36:35,933 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:36:35,933 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:36:35,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:36:35 BoogieIcfgContainer [2024-11-08 23:36:35,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:36:35,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:36:35,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:36:35,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:36:35,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:36:34" (1/3) ... [2024-11-08 23:36:35,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e334503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:36:35, skipping insertion in model container [2024-11-08 23:36:35,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:36:34" (2/3) ... [2024-11-08 23:36:35,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e334503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:36:35, skipping insertion in model container [2024-11-08 23:36:35,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:36:35" (3/3) ... [2024-11-08 23:36:35,945 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-87.i [2024-11-08 23:36:35,963 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:36:35,963 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:36:36,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:36:36,029 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;@6f12f17b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:36:36,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:36:36,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 56 states have internal predecessors, (75), 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-11-08 23:36:36,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 23:36:36,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:36:36,053 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, 1, 1, 1, 1] [2024-11-08 23:36:36,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:36:36,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:36:36,060 INFO L85 PathProgramCache]: Analyzing trace with hash -938730253, now seen corresponding path program 1 times [2024-11-08 23:36:36,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:36:36,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452312577] [2024-11-08 23:36:36,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:36:36,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:36:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:36:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:36:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:36:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:36:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:36:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 23:36:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:36:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 23:36:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:36:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 23:36:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:36:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 23:36:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:36:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 23:36:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:36:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 23:36:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:36:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 23:36:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:36:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:36:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:36:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:36:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:36:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:36:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:36:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 23:36:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:36:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 23:36:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:36:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 23:36:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 23:36:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 23:36:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 23:36:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-08 23:36:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 23:36:36,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:36:36,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452312577] [2024-11-08 23:36:36,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452312577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:36:36,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:36:36,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:36:36,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199802912] [2024-11-08 23:36:36,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:36:36,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:36:36,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:36:36,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:36:36,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:36:36,790 INFO L87 Difference]: Start difference. First operand has 92 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 56 states have internal predecessors, (75), 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 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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-11-08 23:36:36,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:36:36,840 INFO L93 Difference]: Finished difference Result 177 states and 314 transitions. [2024-11-08 23:36:36,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:36:36,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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 213 [2024-11-08 23:36:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:36:36,855 INFO L225 Difference]: With dead ends: 177 [2024-11-08 23:36:36,855 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 23:36:36,860 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-11-08 23:36:36,864 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:36:36,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:36:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 23:36:36,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-08 23:36:36,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 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-11-08 23:36:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 136 transitions. [2024-11-08 23:36:36,954 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 136 transitions. Word has length 213 [2024-11-08 23:36:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:36:36,955 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 136 transitions. [2024-11-08 23:36:36,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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-11-08 23:36:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 136 transitions. [2024-11-08 23:36:36,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 23:36:36,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:36:36,966 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, 1, 1, 1, 1] [2024-11-08 23:36:36,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:36:36,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:36:36,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:36:36,968 INFO L85 PathProgramCache]: Analyzing trace with hash 848476715, now seen corresponding path program 1 times [2024-11-08 23:36:36,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:36:36,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829690227] [2024-11-08 23:36:36,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:36:36,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:36:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:36:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:36:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:36:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:36:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:36:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 23:36:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:36:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 23:36:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:36:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 23:36:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:36:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 23:36:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:36:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 23:36:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:36:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 23:36:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:36:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 23:36:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:36:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:36:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:36:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:36:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:36:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:36:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:36:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 23:36:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:36:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 23:36:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:36:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 23:36:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 23:36:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 23:36:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 23:36:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-08 23:36:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-11-08 23:36:38,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:36:38,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829690227] [2024-11-08 23:36:38,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829690227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:36:38,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707522259] [2024-11-08 23:36:38,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:36:38,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:36:38,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:36:38,244 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-11-08 23:36:38,247 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-11-08 23:36:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:38,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:36:38,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:36:38,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1143 proven. 54 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2024-11-08 23:36:38,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:36:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-11-08 23:36:39,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707522259] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:36:39,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:36:39,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 23:36:39,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481536787] [2024-11-08 23:36:39,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:36:39,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:36:39,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:36:39,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:36:39,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:36:39,162 INFO L87 Difference]: Start difference. First operand 88 states and 136 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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-11-08 23:36:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:36:39,455 INFO L93 Difference]: Finished difference Result 181 states and 276 transitions. [2024-11-08 23:36:39,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:36:39,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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 213 [2024-11-08 23:36:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:36:39,460 INFO L225 Difference]: With dead ends: 181 [2024-11-08 23:36:39,460 INFO L226 Difference]: Without dead ends: 96 [2024-11-08 23:36:39,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 490 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-11-08 23:36:39,462 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 62 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:36:39,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 220 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:36:39,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-08 23:36:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-11-08 23:36:39,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 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-11-08 23:36:39,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 138 transitions. [2024-11-08 23:36:39,482 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 138 transitions. Word has length 213 [2024-11-08 23:36:39,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:36:39,487 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 138 transitions. [2024-11-08 23:36:39,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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-11-08 23:36:39,488 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 138 transitions. [2024-11-08 23:36:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 23:36:39,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:36:39,496 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, 1, 1, 1, 1] [2024-11-08 23:36:39,511 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-11-08 23:36:39,697 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-11-08 23:36:39,698 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:36:39,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:36:39,698 INFO L85 PathProgramCache]: Analyzing trace with hash -172591639, now seen corresponding path program 1 times [2024-11-08 23:36:39,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:36:39,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287577303] [2024-11-08 23:36:39,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:36:39,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:36:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:36:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:36:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:36:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:36:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:36:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 23:36:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:36:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 23:36:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:36:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 23:36:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:36:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 23:36:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:36:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 23:36:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:36:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 23:36:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:36:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 23:36:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:36:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:36:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:36:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:36:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:36:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:36:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:36:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 23:36:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:36:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 23:36:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:36:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 23:36:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 23:36:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 23:36:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 23:36:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-08 23:36:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 132 proven. 60 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2024-11-08 23:36:41,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:36:41,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287577303] [2024-11-08 23:36:41,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287577303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:36:41,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332737592] [2024-11-08 23:36:41,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:36:41,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:36:41,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:36:41,183 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-11-08 23:36:41,185 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-11-08 23:36:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:41,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 23:36:41,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:36:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1229 proven. 60 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2024-11-08 23:36:41,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:36:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 132 proven. 63 refuted. 0 times theorem prover too weak. 2049 trivial. 0 not checked. [2024-11-08 23:36:42,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332737592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:36:42,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:36:42,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2024-11-08 23:36:42,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74117334] [2024-11-08 23:36:42,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:36:42,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 23:36:42,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:36:42,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 23:36:42,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-08 23:36:42,132 INFO L87 Difference]: Start difference. First operand 92 states and 138 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 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-11-08 23:36:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:36:43,155 INFO L93 Difference]: Finished difference Result 304 states and 442 transitions. [2024-11-08 23:36:43,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 23:36:43,157 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 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 213 [2024-11-08 23:36:43,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:36:43,161 INFO L225 Difference]: With dead ends: 304 [2024-11-08 23:36:43,164 INFO L226 Difference]: Without dead ends: 215 [2024-11-08 23:36:43,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 485 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=774, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 23:36:43,167 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 465 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 23:36:43,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 668 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 23:36:43,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-08 23:36:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 184. [2024-11-08 23:36:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 110 states have (on average 1.2272727272727273) internal successors, (135), 111 states have internal predecessors, (135), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 23:36:43,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 267 transitions. [2024-11-08 23:36:43,198 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 267 transitions. Word has length 213 [2024-11-08 23:36:43,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:36:43,199 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 267 transitions. [2024-11-08 23:36:43,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 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-11-08 23:36:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 267 transitions. [2024-11-08 23:36:43,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 23:36:43,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:36:43,206 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, 1, 1, 1, 1] [2024-11-08 23:36:43,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 23:36:43,409 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-11-08 23:36:43,410 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:36:43,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:36:43,411 INFO L85 PathProgramCache]: Analyzing trace with hash 2128230951, now seen corresponding path program 1 times [2024-11-08 23:36:43,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:36:43,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907274073] [2024-11-08 23:36:43,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:36:43,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:36:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:36:43,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1086223162] [2024-11-08 23:36:43,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:36:43,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:36:43,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:36:43,743 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-11-08 23:36:43,745 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-11-08 23:36:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:43,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-08 23:36:43,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:36:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1654 proven. 363 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-11-08 23:36:50,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:37:01,825 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (mod c_~var_1_8~0 256))) (let ((.cse3 (+ c_~var_1_22~0 1 .cse10)) (.cse0 (mod c_~var_1_18~0 65536)) (.cse6 (= (mod c_~var_1_22~0 c_~var_1_6~0) 0)) (.cse2 (+ c_~var_1_22~0 .cse10)) (.cse7 (div c_~var_1_22~0 c_~var_1_6~0))) (and (or (< c_~var_1_22~0 0) (and (forall ((v_y_119 Int) (v_z_119 Int)) (or (< v_z_119 0) (< 0 (+ 2 v_y_119 .cse0)) (< 99 v_z_119))) (forall ((v_y_118 Int)) (< 0 (+ v_y_118 .cse0 1))))) (forall ((v_y_109 Int)) (let ((.cse1 (* v_y_109 100))) (or (< c_~var_1_6~0 (+ .cse1 1)) (< .cse2 (div c_~var_1_22~0 .cse1)) (< 0 (+ v_y_109 .cse0 1)) (not (= (mod c_~var_1_22~0 .cse1) 0))))) (forall ((v_z_116 Int) (v_y_116 Int)) (or (< .cse2 (+ (div c_~var_1_22~0 (+ v_z_116 (* v_y_116 100))) 1)) (< 0 (+ 2 v_y_116 .cse0)) (< 99 v_z_116) (< v_z_116 0))) (forall ((v_y_106 Int)) (let ((.cse4 (* v_y_106 100))) (or (< .cse3 (div c_~var_1_22~0 .cse4)) (= (mod c_~var_1_22~0 .cse4) 0) (< 0 (+ v_y_106 .cse0 1))))) (forall ((v_y_115 Int)) (or (< 0 (+ v_y_115 .cse0 1)) (< .cse2 (+ (div c_~var_1_22~0 (* v_y_115 100)) 1)))) (forall ((v_y_107 Int) (v_z_107 Int)) (let ((.cse5 (+ (* v_y_107 100) v_z_107))) (or (< v_z_107 0) (< 99 v_z_107) (< .cse3 (div c_~var_1_22~0 .cse5)) (= (mod c_~var_1_22~0 .cse5) 0) (< 0 (+ 2 v_y_107 .cse0))))) (or .cse6 (< .cse3 .cse7) (< 0 (+ c_~var_1_6~0 1))) (forall ((v_z_110 Int) (v_y_110 Int)) (let ((.cse9 (* v_y_110 100))) (let ((.cse8 (+ v_z_110 .cse9))) (or (< 0 (+ 2 v_y_110 .cse0)) (< .cse2 (div c_~var_1_22~0 .cse8)) (< v_z_110 0) (< c_~var_1_6~0 (+ v_z_110 .cse9 1)) (< 99 v_z_110) (not (= (mod c_~var_1_22~0 .cse8) 0)))))) (or (< 0 (+ c_~var_1_6~0 (* .cse0 100) 100)) (and (or (< .cse2 .cse7) (not .cse6)) (<= .cse2 .cse7)))))) is different from false [2024-11-08 23:37:02,158 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (mod c_~var_1_8~0 256))) (let ((.cse3 (+ c_~var_1_22~0 1 .cse8)) (.cse5 (div c_~var_1_22~0 c_~var_1_6~0)) (.cse2 (mod c_~var_1_18~0 65536)) (.cse0 (+ c_~var_1_22~0 .cse8))) (and (forall ((v_y_109 Int)) (let ((.cse1 (* v_y_109 100))) (or (< .cse0 (div c_~var_1_22~0 .cse1)) (< 0 (+ v_y_109 .cse2 1)) (not (= (mod c_~var_1_22~0 .cse1) 0))))) (<= (+ c_~var_1_22~0 1) 0) (forall ((v_z_116 Int) (v_y_116 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 (+ v_z_116 (* v_y_116 100))) 1)) (< 0 (+ 2 v_y_116 .cse2)) (< 99 v_z_116) (< v_z_116 0))) (forall ((v_y_106 Int)) (let ((.cse4 (* v_y_106 100))) (or (< .cse3 (div c_~var_1_22~0 .cse4)) (= (mod c_~var_1_22~0 .cse4) 0) (< 0 (+ v_y_106 .cse2 1))))) (forall ((v_y_115 Int)) (or (< 0 (+ v_y_115 .cse2 1)) (< .cse0 (+ (div c_~var_1_22~0 (* v_y_115 100)) 1)))) (or (< 0 (+ c_~var_1_6~0 (* .cse2 100) 100)) (< .cse0 .cse5)) (forall ((v_y_107 Int) (v_z_107 Int)) (let ((.cse6 (+ (* v_y_107 100) v_z_107))) (or (< v_z_107 0) (< 99 v_z_107) (< .cse3 (div c_~var_1_22~0 .cse6)) (= (mod c_~var_1_22~0 .cse6) 0) (< 0 (+ 2 v_y_107 .cse2))))) (or (= (mod c_~var_1_22~0 c_~var_1_6~0) 0) (< .cse3 .cse5) (< 0 (+ c_~var_1_6~0 1))) (forall ((v_z_110 Int) (v_y_110 Int)) (let ((.cse7 (+ v_z_110 (* v_y_110 100)))) (or (< 0 (+ 2 v_y_110 .cse2)) (< .cse0 (div c_~var_1_22~0 .cse7)) (< v_z_110 0) (< 99 v_z_110) (not (= (mod c_~var_1_22~0 .cse7) 0)))))))) is different from false [2024-11-08 23:37:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 23:37:26,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:37:26,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907274073] [2024-11-08 23:37:26,536 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:37:26,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086223162] [2024-11-08 23:37:26,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086223162] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 23:37:26,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:37:26,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [35] total 42 [2024-11-08 23:37:26,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849078302] [2024-11-08 23:37:26,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:37:26,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:37:26,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:37:26,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:37:26,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1269, Unknown=6, NotChecked=154, Total=1722 [2024-11-08 23:37:26,540 INFO L87 Difference]: Start difference. First operand 184 states and 267 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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-11-08 23:37:26,593 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse22 (div c_~var_1_22~0 c_~var_1_5~0)) (.cse7 (= (mod c_~var_1_22~0 c_~var_1_6~0) 0)) (.cse24 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse35 (+ c_~var_1_5~0 1))) (let ((.cse19 (< c_~var_1_22~0 0)) (.cse23 (< 0 .cse35)) (.cse21 (not .cse24)) (.cse8 (< 0 (+ c_~var_1_6~0 1))) (.cse12 (< c_~var_1_5~0 c_~var_1_6~0)) (.cse10 (not .cse7)) (.cse15 (+ .cse22 1)) (.cse16 (< c_~var_1_6~0 .cse35)) (.cse1 (mod c_~var_1_8~0 256)) (.cse11 (+ c_~var_1_25~0 c_~var_1_22~0)) (.cse6 (div c_~var_1_22~0 c_~var_1_6~0))) (let ((.cse9 (< .cse11 .cse6)) (.cse0 (mod c_~var_1_18~0 65536)) (.cse3 (mod (+ 34932 c_~var_1_29~0 .cse1) 65536)) (.cse28 (< .cse11 .cse22)) (.cse4 (< 0 (+ c_~var_1_22~0 1))) (.cse5 (+ c_~var_1_25~0 c_~var_1_22~0 1)) (.cse26 (mod c_~var_1_28~0 4294967296)) (.cse13 (let ((.cse34 (+ c_~var_1_22~0 .cse1))) (let ((.cse31 (< .cse34 .cse22)) (.cse33 (+ c_~var_1_22~0 1 .cse1)) (.cse32 (< .cse34 .cse6))) (and (or (and (or .cse31 .cse16) (or .cse12 .cse32)) .cse19) (or .cse23 .cse24 (< .cse33 .cse22)) (or .cse31 .cse21 .cse16) (or .cse7 (< .cse33 .cse6) .cse8) (or .cse12 (and (or .cse32 .cse10) (<= .cse34 .cse6))) (or (< .cse34 .cse15) .cse16)))))) (and (forall ((v_y_110 Int)) (or (< 0 (+ 2 v_y_110 .cse0)) (forall ((v_z_110 Int)) (or (forall ((v_~var_1_22~0_12 Int)) (let ((.cse2 (+ v_z_110 (* v_y_110 100)))) (or (< (+ v_~var_1_22~0_12 .cse1) (div v_~var_1_22~0_12 .cse2)) (< .cse3 (+ 65536 v_~var_1_22~0_12)) (not (= (mod v_~var_1_22~0_12 .cse2) 0))))) (< v_z_110 0) (< 99 v_z_110))))) (or .cse4 (< .cse5 .cse6) .cse7 .cse8) (or (and (or .cse9 .cse10) (<= .cse11 .cse6)) .cse12) (forall ((v_~var_1_22~0_12 Int)) (or (< .cse3 (+ 65536 v_~var_1_22~0_12)) (forall ((v_z_116 Int) (v_y_116 Int)) (or (< 0 (+ 2 v_y_116 .cse0)) (< 99 v_z_116) (< (+ v_~var_1_22~0_12 .cse1) (+ (div v_~var_1_22~0_12 (+ v_z_116 (* v_y_116 100))) 1)) (< v_z_116 0))))) (or .cse13 (< |c_ULTIMATE.start_step_~stepLocal_5~0#1| (+ .cse0 1))) (or (let ((.cse25 (mod c_~var_1_28~0 65536))) (let ((.cse14 (+ .cse25 c_~var_1_22~0))) (let ((.cse17 (< .cse14 .cse6)) (.cse20 (< .cse14 .cse22)) (.cse18 (+ .cse25 c_~var_1_22~0 1))) (and (or (< .cse14 .cse15) .cse16) (or .cse12 (and (<= .cse14 .cse6) (or .cse17 .cse10))) (or .cse7 (< .cse18 .cse6) .cse8) (or .cse19 (and (or .cse20 .cse16) (or .cse12 .cse17))) (or .cse21 .cse20 .cse16) (or (< .cse18 .cse22) .cse23 .cse24))))) (< .cse1 .cse26)) (or (< 0 (+ c_~var_1_6~0 (* .cse0 100) 100)) (forall ((v_~var_1_22~0_12 Int)) (or (< (+ v_~var_1_22~0_12 .cse1) (div v_~var_1_22~0_12 c_~var_1_6~0)) (< .cse3 (+ 65536 v_~var_1_22~0_12))))) (forall ((v_y_109 Int)) (or (forall ((v_~var_1_22~0_12 Int)) (let ((.cse27 (* v_y_109 100))) (or (< .cse3 (+ 65536 v_~var_1_22~0_12)) (not (= (mod v_~var_1_22~0_12 .cse27) 0)) (< (+ v_~var_1_22~0_12 .cse1) (div v_~var_1_22~0_12 .cse27))))) (< 0 (+ v_y_109 .cse0 1)))) (or .cse19 (and (or .cse12 .cse9) (or .cse28 .cse16))) (forall ((v_~var_1_22~0_12 Int)) (or (< .cse3 (+ 65536 v_~var_1_22~0_12)) (forall ((v_y_107 Int) (v_z_107 Int)) (let ((.cse29 (+ (* v_y_107 100) v_z_107))) (or (< (+ v_~var_1_22~0_12 1 .cse1) (div v_~var_1_22~0_12 .cse29)) (< v_z_107 0) (< 99 v_z_107) (= 0 (mod v_~var_1_22~0_12 .cse29)) (< 0 (+ 2 v_y_107 .cse0))))))) (or (< .cse11 .cse15) .cse16) (forall ((v_~var_1_22~0_12 Int)) (or (forall ((v_y_106 Int)) (let ((.cse30 (* v_y_106 100))) (or (= (mod v_~var_1_22~0_12 .cse30) 0) (< (+ v_~var_1_22~0_12 1 .cse1) (div v_~var_1_22~0_12 .cse30)) (< 0 (+ v_y_106 .cse0 1))))) (< .cse3 (+ 65536 v_~var_1_22~0_12)))) (forall ((v_~var_1_22~0_12 Int)) (or (< .cse3 (+ 65536 v_~var_1_22~0_12)) (forall ((v_y_115 Int)) (or (< 0 (+ v_y_115 .cse0 1)) (< (+ v_~var_1_22~0_12 .cse1) (+ 1 (div v_~var_1_22~0_12 (* v_y_115 100)))))))) (or (forall ((v_~var_1_22~0_12 Int)) (or (< (+ v_~var_1_22~0_12 1 .cse1) (div v_~var_1_22~0_12 c_~var_1_6~0)) (< .cse3 (+ 65536 v_~var_1_22~0_12)) (= (mod v_~var_1_22~0_12 c_~var_1_6~0) 0))) .cse8) (<= 32768 .cse3) (or .cse21 .cse28 .cse16) (or .cse4 .cse23 .cse24 (< .cse5 .cse22)) (or (< .cse26 (+ 1 .cse1)) .cse13))))) is different from false [2024-11-08 23:37:27,907 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~var_1_8~0 256)) (.cse0 (mod c_~var_1_18~0 65536))) (let ((.cse8 (< 0 (+ c_~var_1_6~0 (* .cse0 100) 100))) (.cse6 (+ c_~var_1_22~0 1 .cse1)) (.cse9 (div c_~var_1_22~0 c_~var_1_6~0)) (.cse4 (+ c_~var_1_22~0 .cse1)) (.cse12 (< 0 (+ c_~var_1_6~0 1))) (.cse3 (mod (+ 34932 c_~var_1_29~0 .cse1) 65536))) (and (forall ((v_y_110 Int)) (or (< 0 (+ 2 v_y_110 .cse0)) (forall ((v_z_110 Int)) (or (forall ((v_~var_1_22~0_12 Int)) (let ((.cse2 (+ v_z_110 (* v_y_110 100)))) (or (< (+ v_~var_1_22~0_12 .cse1) (div v_~var_1_22~0_12 .cse2)) (< .cse3 (+ 65536 v_~var_1_22~0_12)) (not (= (mod v_~var_1_22~0_12 .cse2) 0))))) (< v_z_110 0) (< 99 v_z_110))))) (forall ((v_y_109 Int)) (let ((.cse5 (* v_y_109 100))) (or (< .cse4 (div c_~var_1_22~0 .cse5)) (< 0 (+ v_y_109 .cse0 1)) (not (= (mod c_~var_1_22~0 .cse5) 0))))) (<= (+ c_~var_1_22~0 1) 0) (forall ((v_~var_1_22~0_12 Int)) (or (< .cse3 (+ 65536 v_~var_1_22~0_12)) (forall ((v_z_116 Int) (v_y_116 Int)) (or (< 0 (+ 2 v_y_116 .cse0)) (< 99 v_z_116) (< (+ v_~var_1_22~0_12 .cse1) (+ (div v_~var_1_22~0_12 (+ v_z_116 (* v_y_116 100))) 1)) (< v_z_116 0))))) (forall ((v_z_116 Int) (v_y_116 Int)) (or (< .cse4 (+ (div c_~var_1_22~0 (+ v_z_116 (* v_y_116 100))) 1)) (< 0 (+ 2 v_y_116 .cse0)) (< 99 v_z_116) (< v_z_116 0))) (forall ((v_y_106 Int)) (let ((.cse7 (* v_y_106 100))) (or (< .cse6 (div c_~var_1_22~0 .cse7)) (= (mod c_~var_1_22~0 .cse7) 0) (< 0 (+ v_y_106 .cse0 1))))) (forall ((v_y_115 Int)) (or (< 0 (+ v_y_115 .cse0 1)) (< .cse4 (+ (div c_~var_1_22~0 (* v_y_115 100)) 1)))) (or .cse8 (< .cse4 .cse9)) (forall ((v_y_107 Int) (v_z_107 Int)) (let ((.cse10 (+ (* v_y_107 100) v_z_107))) (or (< v_z_107 0) (< 99 v_z_107) (< .cse6 (div c_~var_1_22~0 .cse10)) (= (mod c_~var_1_22~0 .cse10) 0) (< 0 (+ 2 v_y_107 .cse0))))) (or .cse8 (forall ((v_~var_1_22~0_12 Int)) (or (< (+ v_~var_1_22~0_12 .cse1) (div v_~var_1_22~0_12 c_~var_1_6~0)) (< .cse3 (+ 65536 v_~var_1_22~0_12))))) (forall ((v_y_109 Int)) (or (forall ((v_~var_1_22~0_12 Int)) (let ((.cse11 (* v_y_109 100))) (or (< .cse3 (+ 65536 v_~var_1_22~0_12)) (not (= (mod v_~var_1_22~0_12 .cse11) 0)) (< (+ v_~var_1_22~0_12 .cse1) (div v_~var_1_22~0_12 .cse11))))) (< 0 (+ v_y_109 .cse0 1)))) (or (= (mod c_~var_1_22~0 c_~var_1_6~0) 0) (< .cse6 .cse9) .cse12) (forall ((v_~var_1_22~0_12 Int)) (or (< .cse3 (+ 65536 v_~var_1_22~0_12)) (forall ((v_y_107 Int) (v_z_107 Int)) (let ((.cse13 (+ (* v_y_107 100) v_z_107))) (or (< (+ v_~var_1_22~0_12 1 .cse1) (div v_~var_1_22~0_12 .cse13)) (< v_z_107 0) (< 99 v_z_107) (= 0 (mod v_~var_1_22~0_12 .cse13)) (< 0 (+ 2 v_y_107 .cse0))))))) (forall ((v_~var_1_22~0_12 Int)) (or (forall ((v_y_106 Int)) (let ((.cse14 (* v_y_106 100))) (or (= (mod v_~var_1_22~0_12 .cse14) 0) (< (+ v_~var_1_22~0_12 1 .cse1) (div v_~var_1_22~0_12 .cse14)) (< 0 (+ v_y_106 .cse0 1))))) (< .cse3 (+ 65536 v_~var_1_22~0_12)))) (forall ((v_z_110 Int) (v_y_110 Int)) (let ((.cse15 (+ v_z_110 (* v_y_110 100)))) (or (< 0 (+ 2 v_y_110 .cse0)) (< .cse4 (div c_~var_1_22~0 .cse15)) (< v_z_110 0) (< 99 v_z_110) (not (= (mod c_~var_1_22~0 .cse15) 0))))) (forall ((v_~var_1_22~0_12 Int)) (or (< .cse3 (+ 65536 v_~var_1_22~0_12)) (forall ((v_y_115 Int)) (or (< 0 (+ v_y_115 .cse0 1)) (< (+ v_~var_1_22~0_12 .cse1) (+ 1 (div v_~var_1_22~0_12 (* v_y_115 100)))))))) (or (forall ((v_~var_1_22~0_12 Int)) (or (< (+ v_~var_1_22~0_12 1 .cse1) (div v_~var_1_22~0_12 c_~var_1_6~0)) (< .cse3 (+ 65536 v_~var_1_22~0_12)) (= (mod v_~var_1_22~0_12 c_~var_1_6~0) 0))) .cse12) (<= 32768 .cse3)))) is different from false [2024-11-08 23:37:41,011 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 103 DAG size of output: 101 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 23:37:51,347 WARN L286 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 132 DAG size of output: 132 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 23:38:00,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:38:00,085 INFO L93 Difference]: Finished difference Result 423 states and 609 transitions. [2024-11-08 23:38:00,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 23:38:00,087 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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) Word has length 213 [2024-11-08 23:38:00,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:38:00,091 INFO L225 Difference]: With dead ends: 423 [2024-11-08 23:38:00,091 INFO L226 Difference]: Without dead ends: 242 [2024-11-08 23:38:00,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 47.9s TimeCoverageRelationStatistics Valid=326, Invalid=1570, Unknown=12, NotChecked=348, Total=2256 [2024-11-08 23:38:00,094 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 67 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:38:00,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 826 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 4 Unknown, 157 Unchecked, 4.2s Time] [2024-11-08 23:38:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-08 23:38:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 206. [2024-11-08 23:38:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 133 states have internal predecessors, (169), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 23:38:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 301 transitions. [2024-11-08 23:38:00,123 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 301 transitions. Word has length 213 [2024-11-08 23:38:00,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:38:00,124 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 301 transitions. [2024-11-08 23:38:00,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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-11-08 23:38:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 301 transitions. [2024-11-08 23:38:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 23:38:00,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:38:00,127 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, 1, 1, 1, 1] [2024-11-08 23:38:00,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 23:38:00,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:38:00,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:38:00,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:38:00,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2130077993, now seen corresponding path program 1 times [2024-11-08 23:38:00,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:38:00,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788415780] [2024-11-08 23:38:00,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:38:00,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms