./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1aa5ccf491fa19757c49751a869c16c8e81ee57a7445aa2b11849a454021fdb2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:29:29,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:29:29,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:29:29,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:29:29,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:29:29,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:29:29,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:29:29,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:29:29,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:29:29,193 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:29:29,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:29:29,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:29:29,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:29:29,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:29:29,195 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:29:29,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:29:29,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:29:29,201 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:29:29,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:29:29,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:29:29,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:29:29,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:29:29,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:29:29,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:29:29,206 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:29:29,206 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:29:29,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:29:29,207 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:29:29,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:29:29,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:29:29,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:29:29,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:29:29,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:29:29,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:29:29,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:29:29,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:29:29,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:29:29,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:29:29,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:29:29,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:29:29,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:29:29,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:29:29,217 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-clean/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-clean/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 -> 1aa5ccf491fa19757c49751a869c16c8e81ee57a7445aa2b11849a454021fdb2 [2024-10-11 09:29:29,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:29:29,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:29:29,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:29:29,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:29:29,457 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:29:29,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2024-10-11 09:29:30,828 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:29:31,008 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:29:31,009 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2024-10-11 09:29:31,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9b1848374/1408c47307cc4c57b183df5d2f2ba23c/FLAG1ba7aa31e [2024-10-11 09:29:31,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9b1848374/1408c47307cc4c57b183df5d2f2ba23c [2024-10-11 09:29:31,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:29:31,414 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:29:31,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:29:31,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:29:31,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:29:31,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:29:31" (1/1) ... [2024-10-11 09:29:31,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2237f0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:31, skipping insertion in model container [2024-10-11 09:29:31,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:29:31" (1/1) ... [2024-10-11 09:29:31,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:29:31,728 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i[919,932] [2024-10-11 09:29:31,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:29:31,873 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:29:31,889 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i[919,932] [2024-10-11 09:29:31,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:29:31,934 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:29:31,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:31 WrapperNode [2024-10-11 09:29:31,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:29:31,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:29:31,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:29:31,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:29:31,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:31" (1/1) ... [2024-10-11 09:29:31,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:31" (1/1) ... [2024-10-11 09:29:32,038 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-10-11 09:29:32,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:29:32,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:29:32,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:29:32,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:29:32,075 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:31" (1/1) ... [2024-10-11 09:29:32,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:31" (1/1) ... [2024-10-11 09:29:32,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:31" (1/1) ... [2024-10-11 09:29:32,109 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:29:32,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:31" (1/1) ... [2024-10-11 09:29:32,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:31" (1/1) ... [2024-10-11 09:29:32,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:31" (1/1) ... [2024-10-11 09:29:32,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:31" (1/1) ... [2024-10-11 09:29:32,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:31" (1/1) ... [2024-10-11 09:29:32,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:31" (1/1) ... [2024-10-11 09:29:32,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:29:32,144 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:29:32,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:29:32,145 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:29:32,145 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:31" (1/1) ... [2024-10-11 09:29:32,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:29:32,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:29:32,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:29:32,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:29:32,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:29:32,217 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:29:32,217 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:29:32,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:29:32,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:29:32,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:29:32,294 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:29:32,295 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:29:32,603 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 09:29:32,603 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:29:32,642 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:29:32,644 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:29:32,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:29:32 BoogieIcfgContainer [2024-10-11 09:29:32,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:29:32,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:29:32,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:29:32,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:29:32,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:29:31" (1/3) ... [2024-10-11 09:29:32,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0ff944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:29:32, skipping insertion in model container [2024-10-11 09:29:32,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:31" (2/3) ... [2024-10-11 09:29:32,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0ff944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:29:32, skipping insertion in model container [2024-10-11 09:29:32,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:29:32" (3/3) ... [2024-10-11 09:29:32,653 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2024-10-11 09:29:32,667 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:29:32,667 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:29:32,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:29:32,735 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;@2b14c962, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:29:32,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:29:32,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:29:32,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 09:29:32,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:29:32,751 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:29:32,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:29:32,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:29:32,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1352265193, now seen corresponding path program 1 times [2024-10-11 09:29:32,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:29:32,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737025470] [2024-10-11 09:29:32,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:29:32,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:29:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:29:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:29:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:29:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:29:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:29:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:29:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:29:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:29:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:29:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:29:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:29:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:29:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:29:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:29:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:29:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:29:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:29:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:29:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:29:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:29:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:29:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:29:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:29:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:29:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:29:33,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:29:33,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737025470] [2024-10-11 09:29:33,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737025470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:29:33,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:29:33,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:29:33,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191830121] [2024-10-11 09:29:33,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:29:33,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:29:33,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:29:33,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:29:33,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:29:33,270 INFO L87 Difference]: Start difference. First operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:29:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:29:33,313 INFO L93 Difference]: Finished difference Result 165 states and 286 transitions. [2024-10-11 09:29:33,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:29:33,316 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2024-10-11 09:29:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:29:33,322 INFO L225 Difference]: With dead ends: 165 [2024-10-11 09:29:33,324 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 09:29:33,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:29:33,332 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:29:33,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:29:33,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 09:29:33,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-11 09:29:33,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:29:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2024-10-11 09:29:33,373 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 127 transitions. Word has length 160 [2024-10-11 09:29:33,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:29:33,374 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 127 transitions. [2024-10-11 09:29:33,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:29:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 127 transitions. [2024-10-11 09:29:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 09:29:33,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:29:33,379 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:29:33,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:29:33,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:29:33,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:29:33,381 INFO L85 PathProgramCache]: Analyzing trace with hash -535181605, now seen corresponding path program 1 times [2024-10-11 09:29:33,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:29:33,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490600739] [2024-10-11 09:29:33,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:29:33,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:29:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:29:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:29:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:29:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:29:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:29:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:29:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:29:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:29:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:29:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:29:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:29:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:29:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:29:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:29:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:29:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:29:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:29:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:29:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:29:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:29:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:29:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:29:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:29:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:29:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:29:33,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:29:33,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490600739] [2024-10-11 09:29:33,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490600739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:29:33,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:29:33,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:29:33,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207863443] [2024-10-11 09:29:33,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:29:33,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:29:33,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:29:33,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:29:33,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:29:33,680 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:29:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:29:33,755 INFO L93 Difference]: Finished difference Result 207 states and 319 transitions. [2024-10-11 09:29:33,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:29:33,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2024-10-11 09:29:33,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:29:33,760 INFO L225 Difference]: With dead ends: 207 [2024-10-11 09:29:33,762 INFO L226 Difference]: Without dead ends: 126 [2024-10-11 09:29:33,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:29:33,765 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 50 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:29:33,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 229 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:29:33,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-11 09:29:33,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2024-10-11 09:29:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 95 states have internal predecessors, (137), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 09:29:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 189 transitions. [2024-10-11 09:29:33,797 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 189 transitions. Word has length 160 [2024-10-11 09:29:33,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:29:33,798 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 189 transitions. [2024-10-11 09:29:33,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:29:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 189 transitions. [2024-10-11 09:29:33,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 09:29:33,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:29:33,803 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:29:33,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:29:33,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:29:33,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:29:33,804 INFO L85 PathProgramCache]: Analyzing trace with hash 144876765, now seen corresponding path program 1 times [2024-10-11 09:29:33,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:29:33,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584793385] [2024-10-11 09:29:33,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:29:33,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:29:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:29:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:29:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:29:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:29:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:29:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:33,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:29:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:29:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:29:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:29:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:29:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:29:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:29:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:29:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:29:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:29:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:29:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:29:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:29:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:29:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:29:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:29:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:29:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:29:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:29:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:29:34,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:29:34,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584793385] [2024-10-11 09:29:34,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584793385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:29:34,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:29:34,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:29:34,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104762440] [2024-10-11 09:29:34,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:29:34,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:29:34,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:29:34,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:29:34,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:29:34,065 INFO L87 Difference]: Start difference. First operand 123 states and 189 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:29:34,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:29:34,105 INFO L93 Difference]: Finished difference Result 247 states and 381 transitions. [2024-10-11 09:29:34,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:29:34,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2024-10-11 09:29:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:29:34,108 INFO L225 Difference]: With dead ends: 247 [2024-10-11 09:29:34,108 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 09:29:34,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:29:34,110 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:29:34,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:29:34,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 09:29:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-10-11 09:29:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 09:29:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 191 transitions. [2024-10-11 09:29:34,129 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 191 transitions. Word has length 160 [2024-10-11 09:29:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:29:34,129 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 191 transitions. [2024-10-11 09:29:34,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:29:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 191 transitions. [2024-10-11 09:29:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 09:29:34,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:29:34,132 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:29:34,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:29:34,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:29:34,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:29:34,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1467700663, now seen corresponding path program 1 times [2024-10-11 09:29:34,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:29:34,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511731726] [2024-10-11 09:29:34,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:29:34,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:29:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:29:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:29:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:29:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:29:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:29:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:29:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:29:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:29:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:29:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:29:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:29:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:29:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:29:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:29:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:29:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:29:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:29:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:29:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:29:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:29:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:29:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:29:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:29:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:29:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:34,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:29:34,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:29:34,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511731726] [2024-10-11 09:29:34,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511731726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:29:34,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:29:34,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:29:34,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159196758] [2024-10-11 09:29:34,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:29:34,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:29:34,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:29:34,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:29:34,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:29:34,421 INFO L87 Difference]: Start difference. First operand 125 states and 191 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:29:34,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:29:34,601 INFO L93 Difference]: Finished difference Result 371 states and 567 transitions. [2024-10-11 09:29:34,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:29:34,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-11 09:29:34,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:29:34,603 INFO L225 Difference]: With dead ends: 371 [2024-10-11 09:29:34,605 INFO L226 Difference]: Without dead ends: 247 [2024-10-11 09:29:34,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:29:34,607 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 115 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:29:34,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 285 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:29:34,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-11 09:29:34,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 151. [2024-10-11 09:29:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 122 states have (on average 1.4672131147540983) internal successors, (179), 123 states have internal predecessors, (179), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 09:29:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 231 transitions. [2024-10-11 09:29:34,633 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 231 transitions. Word has length 161 [2024-10-11 09:29:34,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:29:34,634 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 231 transitions. [2024-10-11 09:29:34,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:29:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 231 transitions. [2024-10-11 09:29:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 09:29:34,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:29:34,636 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:29:34,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:29:34,636 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:29:34,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:29:34,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2126202055, now seen corresponding path program 1 times [2024-10-11 09:29:34,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:29:34,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197515861] [2024-10-11 09:29:34,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:29:34,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:29:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:29:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:29:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:29:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:29:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:29:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:29:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:29:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:29:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:29:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:29:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:29:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:29:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:29:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:29:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:29:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:29:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:29:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:29:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:29:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:29:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:29:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:29:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:29:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:29:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:35,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:29:35,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:29:35,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197515861] [2024-10-11 09:29:35,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197515861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:29:35,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:29:35,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 09:29:35,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299084840] [2024-10-11 09:29:35,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:29:35,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 09:29:35,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:29:35,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 09:29:35,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:29:35,191 INFO L87 Difference]: Start difference. First operand 151 states and 231 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:29:35,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:29:35,922 INFO L93 Difference]: Finished difference Result 647 states and 971 transitions. [2024-10-11 09:29:35,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 09:29:35,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-10-11 09:29:35,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:29:35,926 INFO L225 Difference]: With dead ends: 647 [2024-10-11 09:29:35,926 INFO L226 Difference]: Without dead ends: 497 [2024-10-11 09:29:35,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-10-11 09:29:35,927 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 399 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 09:29:35,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 456 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 09:29:35,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-11 09:29:35,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 346. [2024-10-11 09:29:35,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 278 states have (on average 1.4316546762589928) internal successors, (398), 282 states have internal predecessors, (398), 61 states have call successors, (61), 6 states have call predecessors, (61), 6 states have return successors, (61), 57 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-11 09:29:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 520 transitions. [2024-10-11 09:29:35,972 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 520 transitions. Word has length 161 [2024-10-11 09:29:35,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:29:35,973 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 520 transitions. [2024-10-11 09:29:35,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:29:35,973 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 520 transitions. [2024-10-11 09:29:35,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 09:29:35,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:29:35,974 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:29:35,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 09:29:35,975 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:29:35,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:29:35,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2068943753, now seen corresponding path program 1 times [2024-10-11 09:29:35,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:29:35,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302567000] [2024-10-11 09:29:35,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:29:35,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:29:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:29:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:29:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:29:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:29:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:29:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:29:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:29:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:29:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:29:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:29:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:29:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:29:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:29:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:29:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:29:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:29:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:29:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:29:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:29:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:29:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:29:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:29:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:29:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:29:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:29:36,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:29:36,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302567000] [2024-10-11 09:29:36,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302567000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:29:36,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:29:36,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:29:36,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926395214] [2024-10-11 09:29:36,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:29:36,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:29:36,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:29:36,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:29:36,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:29:36,600 INFO L87 Difference]: Start difference. First operand 346 states and 520 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:29:37,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:29:37,104 INFO L93 Difference]: Finished difference Result 986 states and 1449 transitions. [2024-10-11 09:29:37,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:29:37,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-11 09:29:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:29:37,108 INFO L225 Difference]: With dead ends: 986 [2024-10-11 09:29:37,108 INFO L226 Difference]: Without dead ends: 641 [2024-10-11 09:29:37,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:29:37,112 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 291 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:29:37,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 347 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:29:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-10-11 09:29:37,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 510. [2024-10-11 09:29:37,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 378 states have (on average 1.3677248677248677) internal successors, (517), 386 states have internal predecessors, (517), 116 states have call successors, (116), 15 states have call predecessors, (116), 15 states have return successors, (116), 108 states have call predecessors, (116), 116 states have call successors, (116) [2024-10-11 09:29:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 749 transitions. [2024-10-11 09:29:37,260 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 749 transitions. Word has length 161 [2024-10-11 09:29:37,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:29:37,260 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 749 transitions. [2024-10-11 09:29:37,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:29:37,261 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 749 transitions. [2024-10-11 09:29:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 09:29:37,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:29:37,262 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:29:37,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 09:29:37,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:29:37,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:29:37,263 INFO L85 PathProgramCache]: Analyzing trace with hash 650052213, now seen corresponding path program 1 times [2024-10-11 09:29:37,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:29:37,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279121685] [2024-10-11 09:29:37,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:29:37,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:29:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:29:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:29:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:29:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:29:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:29:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:29:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:29:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:29:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:29:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:29:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:29:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:29:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:29:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:29:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:29:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:29:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:29:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:29:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:29:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:29:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:29:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:29:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:29:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:29:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:29:37,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:29:37,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279121685] [2024-10-11 09:29:37,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279121685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:29:37,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:29:37,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:29:37,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108478308] [2024-10-11 09:29:37,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:29:37,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:29:37,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:29:37,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:29:37,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:29:37,429 INFO L87 Difference]: Start difference. First operand 510 states and 749 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:29:37,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:29:37,602 INFO L93 Difference]: Finished difference Result 982 states and 1447 transitions. [2024-10-11 09:29:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:29:37,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-11 09:29:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:29:37,607 INFO L225 Difference]: With dead ends: 982 [2024-10-11 09:29:37,607 INFO L226 Difference]: Without dead ends: 510 [2024-10-11 09:29:37,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:29:37,609 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 115 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:29:37,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 174 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:29:37,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-11 09:29:37,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 488. [2024-10-11 09:29:37,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 356 states have (on average 1.348314606741573) internal successors, (480), 364 states have internal predecessors, (480), 116 states have call successors, (116), 15 states have call predecessors, (116), 15 states have return successors, (116), 108 states have call predecessors, (116), 116 states have call successors, (116) [2024-10-11 09:29:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 712 transitions. [2024-10-11 09:29:37,697 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 712 transitions. Word has length 161 [2024-10-11 09:29:37,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:29:37,699 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 712 transitions. [2024-10-11 09:29:37,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:29:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 712 transitions. [2024-10-11 09:29:37,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 09:29:37,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:29:37,701 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:29:37,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 09:29:37,701 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:29:37,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:29:37,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1351116791, now seen corresponding path program 1 times [2024-10-11 09:29:37,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:29:37,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606463904] [2024-10-11 09:29:37,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:29:37,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:29:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:29:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:29:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:29:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:29:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:29:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:29:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:29:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:29:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:29:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:29:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:29:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:29:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:29:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:29:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:29:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:29:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:29:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:29:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:29:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:29:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:29:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:29:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:29:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:29:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:29:38,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:29:38,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606463904] [2024-10-11 09:29:38,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606463904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:29:38,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:29:38,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 09:29:38,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708701663] [2024-10-11 09:29:38,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:29:38,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 09:29:38,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:29:38,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 09:29:38,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 09:29:38,390 INFO L87 Difference]: Start difference. First operand 488 states and 712 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:29:39,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:29:39,459 INFO L93 Difference]: Finished difference Result 1929 states and 2769 transitions. [2024-10-11 09:29:39,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 09:29:39,460 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-10-11 09:29:39,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:29:39,467 INFO L225 Difference]: With dead ends: 1929 [2024-10-11 09:29:39,468 INFO L226 Difference]: Without dead ends: 1479 [2024-10-11 09:29:39,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2024-10-11 09:29:39,470 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 565 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 09:29:39,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 442 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 09:29:39,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2024-10-11 09:29:39,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1168. [2024-10-11 09:29:39,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 871 states have (on average 1.340987370838117) internal successors, (1168), 892 states have internal predecessors, (1168), 261 states have call successors, (261), 35 states have call predecessors, (261), 35 states have return successors, (261), 240 states have call predecessors, (261), 261 states have call successors, (261) [2024-10-11 09:29:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1690 transitions. [2024-10-11 09:29:39,676 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1690 transitions. Word has length 161 [2024-10-11 09:29:39,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:29:39,676 INFO L471 AbstractCegarLoop]: Abstraction has 1168 states and 1690 transitions. [2024-10-11 09:29:39,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:29:39,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1690 transitions. [2024-10-11 09:29:39,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 09:29:39,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:29:39,678 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:29:39,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 09:29:39,678 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:29:39,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:29:39,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1408375093, now seen corresponding path program 1 times [2024-10-11 09:29:39,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:29:39,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950456462] [2024-10-11 09:29:39,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:29:39,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:29:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:29:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:29:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:29:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:29:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:29:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:29:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:29:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:29:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:29:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:29:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:29:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:29:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:29:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:29:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:29:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:29:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:29:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:29:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:29:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:29:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:29:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:29:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:29:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:29:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-11 09:29:40,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:29:40,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950456462] [2024-10-11 09:29:40,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950456462] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:29:40,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762494996] [2024-10-11 09:29:40,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:29:40,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:29:40,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:29:40,426 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:29:40,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:29:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:40,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 09:29:40,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:29:41,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 694 proven. 129 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2024-10-11 09:29:41,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:29:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-11 09:29:42,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762494996] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:29:42,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:29:42,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 15] total 37 [2024-10-11 09:29:42,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293700801] [2024-10-11 09:29:42,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:29:42,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-11 09:29:42,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:29:42,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-11 09:29:42,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 09:29:42,267 INFO L87 Difference]: Start difference. First operand 1168 states and 1690 transitions. Second operand has 37 states, 35 states have (on average 3.6285714285714286) internal successors, (127), 35 states have internal predecessors, (127), 9 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (58), 8 states have call predecessors, (58), 9 states have call successors, (58) [2024-10-11 09:29:49,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:29:49,797 INFO L93 Difference]: Finished difference Result 2808 states and 3961 transitions. [2024-10-11 09:29:49,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2024-10-11 09:29:49,798 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 3.6285714285714286) internal successors, (127), 35 states have internal predecessors, (127), 9 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (58), 8 states have call predecessors, (58), 9 states have call successors, (58) Word has length 161 [2024-10-11 09:29:49,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:29:49,806 INFO L225 Difference]: With dead ends: 2808 [2024-10-11 09:29:49,806 INFO L226 Difference]: Without dead ends: 1678 [2024-10-11 09:29:49,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7001 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4225, Invalid=17237, Unknown=0, NotChecked=0, Total=21462 [2024-10-11 09:29:49,817 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1691 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 3219 mSolverCounterSat, 776 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1698 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 3995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 776 IncrementalHoareTripleChecker+Valid, 3219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:29:49,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1698 Valid, 1852 Invalid, 3995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [776 Valid, 3219 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 09:29:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2024-10-11 09:29:49,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 793. [2024-10-11 09:29:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 590 states have (on average 1.2610169491525425) internal successors, (744), 604 states have internal predecessors, (744), 162 states have call successors, (162), 40 states have call predecessors, (162), 40 states have return successors, (162), 148 states have call predecessors, (162), 162 states have call successors, (162) [2024-10-11 09:29:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1068 transitions. [2024-10-11 09:29:49,949 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1068 transitions. Word has length 161 [2024-10-11 09:29:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:29:49,950 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1068 transitions. [2024-10-11 09:29:49,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 3.6285714285714286) internal successors, (127), 35 states have internal predecessors, (127), 9 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (58), 8 states have call predecessors, (58), 9 states have call successors, (58) [2024-10-11 09:29:49,950 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1068 transitions. [2024-10-11 09:29:49,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 09:29:49,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:29:49,951 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:29:49,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 09:29:50,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:29:50,156 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:29:50,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:29:50,157 INFO L85 PathProgramCache]: Analyzing trace with hash -138049737, now seen corresponding path program 1 times [2024-10-11 09:29:50,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:29:50,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069031705] [2024-10-11 09:29:50,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:29:50,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:29:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:29:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:29:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:29:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:29:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:29:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:29:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:29:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:29:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:29:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:29:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:29:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:29:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:29:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:29:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:29:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:29:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:29:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:29:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:29:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:29:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:29:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:29:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:29:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:29:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:29:50,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:29:50,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069031705] [2024-10-11 09:29:50,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069031705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:29:50,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:29:50,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:29:50,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381314820] [2024-10-11 09:29:50,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:29:50,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:29:50,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:29:50,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:29:50,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:29:50,303 INFO L87 Difference]: Start difference. First operand 793 states and 1068 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:29:50,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:29:50,541 INFO L93 Difference]: Finished difference Result 1465 states and 1967 transitions. [2024-10-11 09:29:50,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:29:50,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-11 09:29:50,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:29:50,545 INFO L225 Difference]: With dead ends: 1465 [2024-10-11 09:29:50,545 INFO L226 Difference]: Without dead ends: 673 [2024-10-11 09:29:50,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:29:50,547 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 45 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:29:50,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 429 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:29:50,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-10-11 09:29:50,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 609. [2024-10-11 09:29:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 438 states have (on average 1.221461187214612) internal successors, (535), 443 states have internal predecessors, (535), 134 states have call successors, (134), 36 states have call predecessors, (134), 36 states have return successors, (134), 129 states have call predecessors, (134), 134 states have call successors, (134) [2024-10-11 09:29:50,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 803 transitions. [2024-10-11 09:29:50,643 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 803 transitions. Word has length 161 [2024-10-11 09:29:50,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:29:50,643 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 803 transitions. [2024-10-11 09:29:50,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:29:50,643 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 803 transitions. [2024-10-11 09:29:50,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 09:29:50,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:29:50,646 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:29:50,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 09:29:50,646 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:29:50,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:29:50,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1917684017, now seen corresponding path program 1 times [2024-10-11 09:29:50,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:29:50,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242953186] [2024-10-11 09:29:50,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:29:50,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:29:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:29:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:29:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:29:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:29:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:29:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:29:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:29:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:29:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:29:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:29:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:29:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:29:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:29:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:29:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:29:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:29:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:29:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:29:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:29:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:29:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:29:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:29:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:29:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:29:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-11 09:29:51,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:29:51,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242953186] [2024-10-11 09:29:51,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242953186] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:29:51,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201303461] [2024-10-11 09:29:51,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:29:51,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:29:51,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:29:51,223 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:29:51,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:29:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:51,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 09:29:51,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:29:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 503 proven. 90 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2024-10-11 09:29:51,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:29:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-11 09:29:52,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201303461] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:29:52,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:29:52,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-11 09:29:52,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139153628] [2024-10-11 09:29:52,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:29:52,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 09:29:52,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:29:52,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 09:29:52,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2024-10-11 09:29:52,260 INFO L87 Difference]: Start difference. First operand 609 states and 803 transitions. Second operand has 21 states, 19 states have (on average 5.947368421052632) internal successors, (113), 19 states have internal predecessors, (113), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) [2024-10-11 09:29:53,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:29:53,222 INFO L93 Difference]: Finished difference Result 1755 states and 2277 transitions. [2024-10-11 09:29:53,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 09:29:53,223 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.947368421052632) internal successors, (113), 19 states have internal predecessors, (113), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) Word has length 162 [2024-10-11 09:29:53,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:29:53,228 INFO L225 Difference]: With dead ends: 1755 [2024-10-11 09:29:53,228 INFO L226 Difference]: Without dead ends: 1147 [2024-10-11 09:29:53,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=404, Invalid=928, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 09:29:53,230 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 382 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 09:29:53,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 740 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 09:29:53,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2024-10-11 09:29:53,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 641. [2024-10-11 09:29:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 470 states have (on average 1.2191489361702128) internal successors, (573), 475 states have internal predecessors, (573), 134 states have call successors, (134), 36 states have call predecessors, (134), 36 states have return successors, (134), 129 states have call predecessors, (134), 134 states have call successors, (134) [2024-10-11 09:29:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 841 transitions. [2024-10-11 09:29:53,328 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 841 transitions. Word has length 162 [2024-10-11 09:29:53,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:29:53,329 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 841 transitions. [2024-10-11 09:29:53,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.947368421052632) internal successors, (113), 19 states have internal predecessors, (113), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) [2024-10-11 09:29:53,330 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 841 transitions. [2024-10-11 09:29:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 09:29:53,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:29:53,331 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:29:53,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 09:29:53,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:29:53,532 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:29:53,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:29:53,532 INFO L85 PathProgramCache]: Analyzing trace with hash 694623270, now seen corresponding path program 1 times [2024-10-11 09:29:53,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:29:53,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758406421] [2024-10-11 09:29:53,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:29:53,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:29:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:29:53,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392695043] [2024-10-11 09:29:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:29:53,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:29:53,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:29:53,619 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:29:53,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 09:29:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:29:53,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:29:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:29:54,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:29:54,008 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:29:54,009 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:29:54,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 09:29:54,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:29:54,214 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:29:54,311 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:29:54,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:29:54 BoogieIcfgContainer [2024-10-11 09:29:54,314 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:29:54,314 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:29:54,315 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:29:54,315 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:29:54,315 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:29:32" (3/4) ... [2024-10-11 09:29:54,317 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:29:54,317 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:29:54,318 INFO L158 Benchmark]: Toolchain (without parser) took 22904.12ms. Allocated memory was 159.4MB in the beginning and 625.0MB in the end (delta: 465.6MB). Free memory was 92.4MB in the beginning and 242.0MB in the end (delta: -149.6MB). Peak memory consumption was 318.5MB. Max. memory is 16.1GB. [2024-10-11 09:29:54,318 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:29:54,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.14ms. Allocated memory is still 159.4MB. Free memory was 92.2MB in the beginning and 74.8MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 09:29:54,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.79ms. Allocated memory is still 159.4MB. Free memory was 74.6MB in the beginning and 129.3MB in the end (delta: -54.6MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-10-11 09:29:54,318 INFO L158 Benchmark]: Boogie Preprocessor took 100.00ms. Allocated memory is still 159.4MB. Free memory was 129.3MB in the beginning and 120.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 09:29:54,319 INFO L158 Benchmark]: RCFGBuilder took 500.01ms. Allocated memory is still 159.4MB. Free memory was 120.9MB in the beginning and 89.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 09:29:54,319 INFO L158 Benchmark]: TraceAbstraction took 21666.99ms. Allocated memory was 159.4MB in the beginning and 625.0MB in the end (delta: 465.6MB). Free memory was 88.8MB in the beginning and 242.0MB in the end (delta: -153.2MB). Peak memory consumption was 315.5MB. Max. memory is 16.1GB. [2024-10-11 09:29:54,319 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 625.0MB. Free memory is still 242.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:29:54,320 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.14ms. Allocated memory is still 159.4MB. Free memory was 92.2MB in the beginning and 74.8MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.79ms. Allocated memory is still 159.4MB. Free memory was 74.6MB in the beginning and 129.3MB in the end (delta: -54.6MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.00ms. Allocated memory is still 159.4MB. Free memory was 129.3MB in the beginning and 120.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 500.01ms. Allocated memory is still 159.4MB. Free memory was 120.9MB in the beginning and 89.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21666.99ms. Allocated memory was 159.4MB in the beginning and 625.0MB in the end (delta: 465.6MB). Free memory was 88.8MB in the beginning and 242.0MB in the end (delta: -153.2MB). Peak memory consumption was 315.5MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 625.0MB. Free memory is still 242.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someUnaryDOUBLEoperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryArithmeticFLOAToperation at line 57, overapproximation of someUnaryFLOAToperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_8 = 1; [L25] signed short int var_1_9 = -2; [L26] float var_1_13 = 999.4; [L27] float var_1_14 = 100.425; [L28] float var_1_15 = 3.375; [L29] float var_1_16 = 15.9; [L30] signed short int var_1_17 = -10; [L31] signed short int var_1_18 = 18060; [L32] unsigned char var_1_20 = 0; [L33] unsigned long int var_1_21 = 4; [L34] unsigned char var_1_23 = 0; [L35] unsigned char var_1_24 = 0; [L36] unsigned char var_1_25 = 100; [L37] unsigned char var_1_26 = 32; [L38] unsigned char var_1_27 = 10; [L39] unsigned char var_1_28 = 1; [L40] unsigned short int var_1_29 = 256; [L41] unsigned char var_1_30 = 1; [L42] unsigned char var_1_31 = 4; [L43] double var_1_33 = 31.625; [L44] double var_1_36 = 15.75; [L45] double var_1_37 = 15.375; [L46] unsigned short int var_1_38 = 16; [L47] unsigned char var_1_39 = 0; [L48] double var_1_44 = 128.5; [L49] float var_1_45 = 1.85; [L50] double var_1_46 = 1.5; [L51] double var_1_47 = 99999999999.4; [L52] unsigned char var_1_49 = 128; [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] FCALL updateLastVariables() [L177] CALL updateVariables() [L126] var_1_7 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L127] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L129] var_1_8 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L130] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L132] var_1_14 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L133] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L134] var_1_15 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L135] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L136] var_1_16 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L137] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L138] var_1_18 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_18 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L139] RET assume_abort_if_not(var_1_18 >= 16382) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L141] var_1_21 = __VERIFIER_nondet_ulong() [L142] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L142] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L145] var_1_23 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L146] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L148] var_1_24 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L149] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L151] var_1_26 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L152] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L154] var_1_27 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L155] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L157] var_1_36 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L158] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L159] var_1_37 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L160] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L161] var_1_46 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L162] RET assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L163] var_1_47 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L164] RET assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L177] RET updateVariables() [L178] CALL step() [L56] COND TRUE \read(var_1_8) [L57] var_1_13 = (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L59] COND TRUE \read(var_1_8) [L60] var_1_25 = (var_1_26 + var_1_27) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L62] COND FALSE !((var_1_16 * (var_1_46 - var_1_47)) < var_1_15) [L67] var_1_45 = (((((((((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) < (var_1_37)) ? (((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) : (var_1_37))) < 0 ) ? -((((((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) < (var_1_37)) ? (((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) : (var_1_37))) : ((((((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) < (var_1_37)) ? (((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) : (var_1_37))))) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L69] var_1_29 = var_1_27 [L70] var_1_38 = ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27))) [L71] var_1_30 = var_1_8 VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=257/2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L72] COND FALSE !((var_1_29 > var_1_25) && var_1_30) [L75] var_1_9 = ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=257/2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L77] var_1_31 = var_1_26 [L78] var_1_17 = ((var_1_18 - 25) - var_1_25) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=257/2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L79] COND FALSE !(var_1_36 <= var_1_14) [L84] var_1_44 = var_1_36 VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L86] signed long int stepLocal_2 = var_1_25 + var_1_17; VAL [isInitial=1, stepLocal_2=16357, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L87] COND TRUE ((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < stepLocal_2 [L88] var_1_20 = (var_1_23 || var_1_24) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L92] EXPR var_1_29 & (var_1_18 + 2u) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L92] EXPR 16u >> var_1_26 VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L92] COND TRUE (var_1_29 & (var_1_18 + 2u)) < (16u >> var_1_26) [L93] var_1_39 = ((var_1_7 && (var_1_8 && var_1_7)) && (! var_1_23)) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L95] signed short int stepLocal_3 = var_1_9; VAL [isInitial=1, stepLocal_3=0, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L96] COND FALSE !((~ var_1_29) > stepLocal_3) [L99] var_1_28 = (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L101] COND FALSE !(! var_1_8) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L104] var_1_8 || (var_1_27 >= (var_1_25 & var_1_18)) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L104] COND TRUE var_1_8 || (var_1_27 >= (var_1_25 & var_1_18)) [L105] COND FALSE !(-2 > var_1_18) [L108] var_1_49 = var_1_27 VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=-256, var_1_7=1, var_1_8=1, var_1_9=0] [L111] signed long int stepLocal_1 = (((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25)); [L112] unsigned char stepLocal_0 = var_1_25; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=-256, var_1_7=1, var_1_8=1, var_1_9=0] [L113] COND TRUE stepLocal_1 <= (var_1_25 - var_1_25) VAL [isInitial=1, stepLocal_0=0, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=-256, var_1_7=1, var_1_8=1, var_1_9=0] [L114] COND FALSE !(stepLocal_0 < var_1_25) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=-256, var_1_7=1, var_1_8=1, var_1_9=0] [L178] RET step() [L179] CALL, EXPR property() [L169-L170] return (((((((((((((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25))) <= (var_1_25 - var_1_25)) ? ((var_1_25 < var_1_25) ? (var_1_20 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : 1) : (var_1_1 == ((unsigned char) 0))) && (((var_1_29 > var_1_25) && var_1_30) ? (var_1_9 == ((signed short int) var_1_25)) : (var_1_9 == ((signed short int) ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))))))) && (var_1_8 ? (var_1_13 == ((float) (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))))) : 1)) && (var_1_17 == ((signed short int) ((var_1_18 - 25) - var_1_25)))) && ((((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < (var_1_25 + var_1_17)) ? (var_1_20 == ((unsigned char) (var_1_23 || var_1_24))) : (var_1_20 == ((unsigned char) var_1_7)))) && (var_1_8 ? (var_1_25 == ((unsigned char) (var_1_26 + var_1_27))) : 1)) && (((~ var_1_29) > var_1_9) ? (var_1_28 == ((unsigned char) (! var_1_7))) : (var_1_28 == ((unsigned char) (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))))))) && (var_1_29 == ((unsigned short int) var_1_27))) && (var_1_30 == ((unsigned char) var_1_8)) ; [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=-256, var_1_7=1, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=-256, var_1_7=1, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.5s, OverallIterations: 12, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3674 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3653 mSDsluCounter, 5318 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3659 mSDsCounter, 1350 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5231 IncrementalHoareTripleChecker+Invalid, 6581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1350 mSolverCounterUnsat, 1659 mSDtfsCounter, 5231 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1439 GetRequests, 1223 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7285 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1168occurred in iteration=8, InterpolantAutomatonStates: 184, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 2169 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 2416 NumberOfCodeBlocks, 2416 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2400 ConstructedInterpolants, 0 QuantifiedInterpolants, 9331 SizeOfPredicates, 15 NumberOfNonLiveVariables, 767 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 16059/16560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 09:29:54,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1aa5ccf491fa19757c49751a869c16c8e81ee57a7445aa2b11849a454021fdb2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:29:56,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:29:56,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:29:56,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:29:56,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:29:56,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:29:56,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:29:56,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:29:56,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:29:56,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:29:56,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:29:56,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:29:56,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:29:56,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:29:56,594 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:29:56,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:29:56,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:29:56,595 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:29:56,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:29:56,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:29:56,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:29:56,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:29:56,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:29:56,599 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:29:56,599 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:29:56,599 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:29:56,600 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:29:56,600 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:29:56,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:29:56,600 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:29:56,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:29:56,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:29:56,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:29:56,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:29:56,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:29:56,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:29:56,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:29:56,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:29:56,612 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:29:56,612 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:29:56,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:29:56,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:29:56,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:29:56,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:29:56,614 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:29:56,614 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-clean/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-clean/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 -> 1aa5ccf491fa19757c49751a869c16c8e81ee57a7445aa2b11849a454021fdb2 [2024-10-11 09:29:56,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:29:56,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:29:56,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:29:56,937 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:29:56,937 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:29:56,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2024-10-11 09:29:58,316 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:29:58,541 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:29:58,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2024-10-11 09:29:58,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b38a32279/bd0471e9db1443bc9c6335b8ff5196ca/FLAG5e7dc9cc2 [2024-10-11 09:29:58,568 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b38a32279/bd0471e9db1443bc9c6335b8ff5196ca [2024-10-11 09:29:58,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:29:58,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:29:58,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:29:58,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:29:58,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:29:58,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:29:58" (1/1) ... [2024-10-11 09:29:58,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69324ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:58, skipping insertion in model container [2024-10-11 09:29:58,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:29:58" (1/1) ... [2024-10-11 09:29:58,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:29:58,761 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i[919,932] [2024-10-11 09:29:58,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:29:58,849 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:29:58,858 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i[919,932] [2024-10-11 09:29:58,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:29:58,910 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:29:58,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:58 WrapperNode [2024-10-11 09:29:58,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:29:58,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:29:58,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:29:58,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:29:58,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:58" (1/1) ... [2024-10-11 09:29:58,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:58" (1/1) ... [2024-10-11 09:29:58,990 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-10-11 09:29:58,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:29:58,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:29:58,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:29:58,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:29:58,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:58" (1/1) ... [2024-10-11 09:29:59,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:58" (1/1) ... [2024-10-11 09:29:59,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:58" (1/1) ... [2024-10-11 09:29:59,024 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:29:59,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:58" (1/1) ... [2024-10-11 09:29:59,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:58" (1/1) ... [2024-10-11 09:29:59,043 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:58" (1/1) ... [2024-10-11 09:29:59,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:58" (1/1) ... [2024-10-11 09:29:59,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:58" (1/1) ... [2024-10-11 09:29:59,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:58" (1/1) ... [2024-10-11 09:29:59,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:29:59,064 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:29:59,064 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:29:59,064 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:29:59,065 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:58" (1/1) ... [2024-10-11 09:29:59,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:29:59,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:29:59,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:29:59,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:29:59,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:29:59,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:29:59,133 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:29:59,133 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:29:59,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:29:59,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:29:59,197 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:29:59,199 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:30:09,993 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 09:30:09,993 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:30:10,023 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:30:10,023 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:30:10,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:30:10 BoogieIcfgContainer [2024-10-11 09:30:10,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:30:10,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:30:10,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:30:10,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:30:10,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:29:58" (1/3) ... [2024-10-11 09:30:10,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f31333c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:30:10, skipping insertion in model container [2024-10-11 09:30:10,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:58" (2/3) ... [2024-10-11 09:30:10,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f31333c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:30:10, skipping insertion in model container [2024-10-11 09:30:10,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:30:10" (3/3) ... [2024-10-11 09:30:10,030 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2024-10-11 09:30:10,041 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:30:10,042 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:30:10,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:30:10,092 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;@116850b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:30:10,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:30:10,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 47 states have internal predecessors, (67), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:30:10,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 09:30:10,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:10,109 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:10,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:10,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:10,113 INFO L85 PathProgramCache]: Analyzing trace with hash 262566334, now seen corresponding path program 1 times [2024-10-11 09:30:10,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:30:10,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319233167] [2024-10-11 09:30:10,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:10,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:30:10,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:30:10,128 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:30:10,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 09:30:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:10,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:30:10,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:30:10,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-10-11 09:30:10,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:30:10,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:30:10,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319233167] [2024-10-11 09:30:10,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319233167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:10,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:10,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:30:10,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268524379] [2024-10-11 09:30:10,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:10,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:30:10,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:30:10,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:30:10,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:30:10,795 INFO L87 Difference]: Start difference. First operand has 73 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 47 states have internal predecessors, (67), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:30:10,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:10,935 INFO L93 Difference]: Finished difference Result 143 states and 252 transitions. [2024-10-11 09:30:10,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:30:10,946 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2024-10-11 09:30:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:10,952 INFO L225 Difference]: With dead ends: 143 [2024-10-11 09:30:10,953 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 09:30:10,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:30:10,958 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:10,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:30:10,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 09:30:10,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-11 09:30:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:30:10,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2024-10-11 09:30:10,992 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 156 [2024-10-11 09:30:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:10,992 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2024-10-11 09:30:10,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:30:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2024-10-11 09:30:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 09:30:10,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:10,995 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:11,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 09:30:11,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:30:11,196 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:11,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:11,197 INFO L85 PathProgramCache]: Analyzing trace with hash -354735998, now seen corresponding path program 1 times [2024-10-11 09:30:11,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:30:11,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961909895] [2024-10-11 09:30:11,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:11,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:30:11,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:30:11,203 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:30:11,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 09:30:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 09:30:11,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:30:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:30:12,117 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:30:12,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:30:12,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961909895] [2024-10-11 09:30:12,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961909895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:12,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:12,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:30:12,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64731705] [2024-10-11 09:30:12,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:12,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:30:12,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:30:12,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:30:12,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:30:12,120 INFO L87 Difference]: Start difference. First operand 71 states and 110 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:30:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:12,658 INFO L93 Difference]: Finished difference Result 191 states and 297 transitions. [2024-10-11 09:30:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:30:12,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2024-10-11 09:30:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:12,665 INFO L225 Difference]: With dead ends: 191 [2024-10-11 09:30:12,665 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 09:30:12,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:30:12,674 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 101 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:12,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 433 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:30:12,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 09:30:12,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 71. [2024-10-11 09:30:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:30:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 109 transitions. [2024-10-11 09:30:12,690 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 109 transitions. Word has length 156 [2024-10-11 09:30:12,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:12,692 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 109 transitions. [2024-10-11 09:30:12,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:30:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 109 transitions. [2024-10-11 09:30:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 09:30:12,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:12,694 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:12,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 09:30:12,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:30:12,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:12,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:12,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1164082624, now seen corresponding path program 1 times [2024-10-11 09:30:12,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:30:12,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605528046] [2024-10-11 09:30:12,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:12,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:30:12,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:30:12,907 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:30:12,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 09:30:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 09:30:13,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:30:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 195 proven. 63 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2024-10-11 09:30:15,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:30:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-11 09:30:17,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:30:17,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605528046] [2024-10-11 09:30:17,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605528046] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:30:17,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:30:17,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-11 09:30:17,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428351298] [2024-10-11 09:30:17,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:30:17,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 09:30:17,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:30:17,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 09:30:17,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:30:17,881 INFO L87 Difference]: Start difference. First operand 71 states and 109 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-11 09:30:19,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:19,613 INFO L93 Difference]: Finished difference Result 147 states and 222 transitions. [2024-10-11 09:30:19,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 09:30:19,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 156 [2024-10-11 09:30:19,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:19,619 INFO L225 Difference]: With dead ends: 147 [2024-10-11 09:30:19,619 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 09:30:19,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-11 09:30:19,622 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 29 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:19,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 161 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 09:30:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 09:30:19,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2024-10-11 09:30:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:30:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2024-10-11 09:30:19,646 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 156 [2024-10-11 09:30:19,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:19,651 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2024-10-11 09:30:19,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-11 09:30:19,651 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2024-10-11 09:30:19,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 09:30:19,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:19,652 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:19,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 09:30:19,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:30:19,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:19,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:19,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1264767887, now seen corresponding path program 1 times [2024-10-11 09:30:19,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:30:19,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216050957] [2024-10-11 09:30:19,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:19,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:30:19,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:30:19,859 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:30:19,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 09:30:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:20,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 09:30:20,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:30:22,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 485 proven. 48 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2024-10-11 09:30:22,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:30:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-11 09:30:23,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:30:23,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216050957] [2024-10-11 09:30:23,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216050957] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:30:23,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:30:23,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 09:30:23,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669359161] [2024-10-11 09:30:23,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:30:23,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:30:23,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:30:23,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:30:23,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:30:23,658 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-10-11 09:30:25,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:25,212 INFO L93 Difference]: Finished difference Result 155 states and 220 transitions. [2024-10-11 09:30:25,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 09:30:25,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 157 [2024-10-11 09:30:25,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:25,225 INFO L225 Difference]: With dead ends: 155 [2024-10-11 09:30:25,225 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 09:30:25,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:30:25,229 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 62 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:25,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 158 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 09:30:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 09:30:25,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-10-11 09:30:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:30:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 110 transitions. [2024-10-11 09:30:25,243 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 110 transitions. Word has length 157 [2024-10-11 09:30:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:25,244 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 110 transitions. [2024-10-11 09:30:25,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-10-11 09:30:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. [2024-10-11 09:30:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 09:30:25,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:25,249 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:25,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 09:30:25,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:30:25,450 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:25,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:25,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1207509585, now seen corresponding path program 1 times [2024-10-11 09:30:25,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:30:25,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389757365] [2024-10-11 09:30:25,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:25,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:30:25,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:30:25,454 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:30:25,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 09:30:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:25,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 09:30:25,940 INFO L278 TraceCheckSpWp]: Computing forward predicates...