./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4edfcd6a0e29414c9c789482fc7cedb09715c187ed4e164b3ba4e4f923719adc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:11:07,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:11:07,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:11:07,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:11:07,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:11:07,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:11:07,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:11:07,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:11:07,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:11:07,208 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:11:07,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:11:07,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:11:07,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:11:07,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:11:07,211 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:11:07,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:11:07,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:11:07,211 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:11:07,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:11:07,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:11:07,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:11:07,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:11:07,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:11:07,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:11:07,214 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:11:07,215 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:11:07,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:11:07,215 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:11:07,215 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:11:07,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:11:07,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:11:07,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:11:07,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:11:07,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:11:07,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:11:07,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:11:07,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:11:07,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:11:07,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:11:07,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:11:07,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:11:07,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:11:07,218 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4edfcd6a0e29414c9c789482fc7cedb09715c187ed4e164b3ba4e4f923719adc [2024-11-12 01:11:07,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:11:07,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:11:07,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:11:07,561 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:11:07,562 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:11:07,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i [2024-11-12 01:11:08,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:11:08,958 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:11:08,958 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i [2024-11-12 01:11:08,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5862c0db2/8f02bfa282db4cb0b8a8de9cd2b7d5d9/FLAG9046a14ee [2024-11-12 01:11:08,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5862c0db2/8f02bfa282db4cb0b8a8de9cd2b7d5d9 [2024-11-12 01:11:08,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:11:08,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:11:08,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:11:08,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:11:09,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:11:09,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:11:08" (1/1) ... [2024-11-12 01:11:09,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a47cbce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:09, skipping insertion in model container [2024-11-12 01:11:09,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:11:08" (1/1) ... [2024-11-12 01:11:09,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:11:09,173 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i[913,926] [2024-11-12 01:11:09,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:11:09,231 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:11:09,240 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i[913,926] [2024-11-12 01:11:09,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:11:09,280 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:11:09,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:09 WrapperNode [2024-11-12 01:11:09,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:11:09,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:11:09,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:11:09,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:11:09,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:09" (1/1) ... [2024-11-12 01:11:09,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:09" (1/1) ... [2024-11-12 01:11:09,314 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-12 01:11:09,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:11:09,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:11:09,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:11:09,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:11:09,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:09" (1/1) ... [2024-11-12 01:11:09,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:09" (1/1) ... [2024-11-12 01:11:09,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:09" (1/1) ... [2024-11-12 01:11:09,344 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:11:09,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:09" (1/1) ... [2024-11-12 01:11:09,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:09" (1/1) ... [2024-11-12 01:11:09,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:09" (1/1) ... [2024-11-12 01:11:09,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:09" (1/1) ... [2024-11-12 01:11:09,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:09" (1/1) ... [2024-11-12 01:11:09,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:09" (1/1) ... [2024-11-12 01:11:09,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:11:09,358 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:11:09,359 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:11:09,359 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:11:09,359 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:09" (1/1) ... [2024-11-12 01:11:09,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:11:09,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:11:09,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:11:09,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:11:09,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:11:09,440 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:11:09,440 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:11:09,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:11:09,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:11:09,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:11:09,509 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:11:09,510 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:11:09,816 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 01:11:09,817 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:11:09,827 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:11:09,828 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:11:09,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:11:09 BoogieIcfgContainer [2024-11-12 01:11:09,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:11:09,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:11:09,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:11:09,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:11:09,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:11:08" (1/3) ... [2024-11-12 01:11:09,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7299a038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:11:09, skipping insertion in model container [2024-11-12 01:11:09,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:09" (2/3) ... [2024-11-12 01:11:09,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7299a038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:11:09, skipping insertion in model container [2024-11-12 01:11:09,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:11:09" (3/3) ... [2024-11-12 01:11:09,837 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-16.i [2024-11-12 01:11:09,851 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:11:09,852 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:11:09,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:11:09,903 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;@4fde0c73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:11:09,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:11:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 51 states have (on average 1.411764705882353) internal successors, (72), 52 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:11:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 01:11:09,916 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:11:09,917 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:11:09,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:11:09,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:11:09,923 INFO L85 PathProgramCache]: Analyzing trace with hash 575328427, now seen corresponding path program 1 times [2024-11-12 01:11:09,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:11:09,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023478939] [2024-11-12 01:11:09,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:11:09,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:11:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:11:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:11:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:11:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:11:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:11:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:11:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:11:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:11:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:11:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:11:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:11:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:11:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:11:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:11:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:11:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 01:11:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:11:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:11:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:11:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:11:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:11:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:11:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:11:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:11:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 01:11:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 01:11:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:11:10,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:11:10,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023478939] [2024-11-12 01:11:10,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023478939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:11:10,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:11:10,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:11:10,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156379785] [2024-11-12 01:11:10,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:11:10,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:11:10,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:11:10,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:11:10,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:11:10,297 INFO L87 Difference]: Start difference. First operand has 80 states, 51 states have (on average 1.411764705882353) internal successors, (72), 52 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 01:11:10,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:11:10,322 INFO L93 Difference]: Finished difference Result 153 states and 268 transitions. [2024-11-12 01:11:10,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:11:10,324 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2024-11-12 01:11:10,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:11:10,331 INFO L225 Difference]: With dead ends: 153 [2024-11-12 01:11:10,332 INFO L226 Difference]: Without dead ends: 76 [2024-11-12 01:11:10,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:11:10,338 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:11:10,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:11:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-12 01:11:10,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-12 01:11:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:11:10,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 117 transitions. [2024-11-12 01:11:10,379 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 117 transitions. Word has length 165 [2024-11-12 01:11:10,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:11:10,379 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 117 transitions. [2024-11-12 01:11:10,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 01:11:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 117 transitions. [2024-11-12 01:11:10,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 01:11:10,382 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:11:10,382 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:11:10,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:11:10,383 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:11:10,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:11:10,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1616907277, now seen corresponding path program 1 times [2024-11-12 01:11:10,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:11:10,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316916483] [2024-11-12 01:11:10,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:11:10,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:11:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:11:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:11:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:11:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:11:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:11:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:11:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:11:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:11:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:11:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:11:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:11:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:11:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:11:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:11:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:11:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 01:11:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:11:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:11:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:11:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:11:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:11:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:11:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:11:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:11:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 01:11:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 01:11:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:11:10,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:11:10,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316916483] [2024-11-12 01:11:10,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316916483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:11:10,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:11:10,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:11:10,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373896360] [2024-11-12 01:11:10,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:11:10,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:11:10,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:11:10,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:11:10,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:11:10,703 INFO L87 Difference]: Start difference. First operand 76 states and 117 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:11:10,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:11:10,763 INFO L93 Difference]: Finished difference Result 185 states and 284 transitions. [2024-11-12 01:11:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:11:10,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-11-12 01:11:10,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:11:10,768 INFO L225 Difference]: With dead ends: 185 [2024-11-12 01:11:10,768 INFO L226 Difference]: Without dead ends: 112 [2024-11-12 01:11:10,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-11-12 01:11:10,770 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 50 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:11:10,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 231 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:11:10,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-12 01:11:10,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2024-11-12 01:11:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 01:11:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 166 transitions. [2024-11-12 01:11:10,794 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 166 transitions. Word has length 165 [2024-11-12 01:11:10,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:11:10,794 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 166 transitions. [2024-11-12 01:11:10,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:11:10,795 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 166 transitions. [2024-11-12 01:11:10,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 01:11:10,798 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:11:10,799 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:11:10,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:11:10,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:11:10,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:11:10,800 INFO L85 PathProgramCache]: Analyzing trace with hash 158100085, now seen corresponding path program 1 times [2024-11-12 01:11:10,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:11:10,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176111068] [2024-11-12 01:11:10,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:11:10,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:11:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:11:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:11:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:11:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:11:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:11:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:11:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:11:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:11:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:11:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:11:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:11:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:11:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:11:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:11:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:11:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 01:11:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:11:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:11:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:11:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:11:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:11:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:11:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:11:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:11:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 01:11:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 01:11:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:11:15,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:11:15,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176111068] [2024-11-12 01:11:15,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176111068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:11:15,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:11:15,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 01:11:15,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146457247] [2024-11-12 01:11:15,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:11:15,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 01:11:15,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:11:15,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 01:11:15,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 01:11:15,127 INFO L87 Difference]: Start difference. First operand 109 states and 166 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:11:15,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:11:15,438 INFO L93 Difference]: Finished difference Result 306 states and 467 transitions. [2024-11-12 01:11:15,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 01:11:15,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-11-12 01:11:15,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:11:15,442 INFO L225 Difference]: With dead ends: 306 [2024-11-12 01:11:15,442 INFO L226 Difference]: Without dead ends: 200 [2024-11-12 01:11:15,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 01:11:15,444 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 117 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:11:15,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 264 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:11:15,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-12 01:11:15,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 136. [2024-11-12 01:11:15,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 104 states have internal predecessors, (152), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 01:11:15,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 212 transitions. [2024-11-12 01:11:15,460 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 212 transitions. Word has length 165 [2024-11-12 01:11:15,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:11:15,460 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 212 transitions. [2024-11-12 01:11:15,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:11:15,461 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 212 transitions. [2024-11-12 01:11:15,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 01:11:15,462 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:11:15,463 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:11:15,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 01:11:15,463 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:11:15,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:11:15,463 INFO L85 PathProgramCache]: Analyzing trace with hash -853017165, now seen corresponding path program 1 times [2024-11-12 01:11:15,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:11:15,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167307395] [2024-11-12 01:11:15,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:11:15,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:11:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:11:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:11:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:11:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:11:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:11:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:11:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:11:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:11:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:11:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:11:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:11:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:11:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:11:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:11:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:11:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 01:11:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:11:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:11:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:11:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:11:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:11:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:11:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:11:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:11:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 01:11:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 01:11:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:11:17,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:11:17,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167307395] [2024-11-12 01:11:17,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167307395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:11:17,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:11:17,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 01:11:17,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620554888] [2024-11-12 01:11:17,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:11:17,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 01:11:17,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:11:17,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 01:11:17,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 01:11:17,061 INFO L87 Difference]: Start difference. First operand 136 states and 212 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:11:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:11:17,393 INFO L93 Difference]: Finished difference Result 311 states and 484 transitions. [2024-11-12 01:11:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 01:11:17,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-11-12 01:11:17,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:11:17,396 INFO L225 Difference]: With dead ends: 311 [2024-11-12 01:11:17,396 INFO L226 Difference]: Without dead ends: 178 [2024-11-12 01:11:17,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 01:11:17,398 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 28 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:11:17,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 380 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:11:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-12 01:11:17,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 130. [2024-11-12 01:11:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 98 states have internal predecessors, (142), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 01:11:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 202 transitions. [2024-11-12 01:11:17,408 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 202 transitions. Word has length 165 [2024-11-12 01:11:17,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:11:17,409 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 202 transitions. [2024-11-12 01:11:17,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:11:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 202 transitions. [2024-11-12 01:11:17,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-12 01:11:17,411 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:11:17,411 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:11:17,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 01:11:17,411 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:11:17,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:11:17,412 INFO L85 PathProgramCache]: Analyzing trace with hash 639002474, now seen corresponding path program 1 times [2024-11-12 01:11:17,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:11:17,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010030903] [2024-11-12 01:11:17,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:11:17,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:11:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:11:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:11:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:11:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:11:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:11:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:11:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:11:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:11:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:11:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:11:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:11:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:11:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:11:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:11:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:11:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 01:11:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:11:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:11:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:11:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:11:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:11:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:11:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:11:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:11:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 01:11:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 01:11:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:17,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:11:17,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:11:17,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010030903] [2024-11-12 01:11:17,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010030903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:11:17,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:11:17,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:11:17,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243123903] [2024-11-12 01:11:17,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:11:17,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:11:17,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:11:17,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:11:17,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:11:17,523 INFO L87 Difference]: Start difference. First operand 130 states and 202 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:11:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:11:17,551 INFO L93 Difference]: Finished difference Result 279 states and 428 transitions. [2024-11-12 01:11:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:11:17,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-11-12 01:11:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:11:17,553 INFO L225 Difference]: With dead ends: 279 [2024-11-12 01:11:17,553 INFO L226 Difference]: Without dead ends: 152 [2024-11-12 01:11:17,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-11-12 01:11:17,554 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 42 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:11:17,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 256 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:11:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-12 01:11:17,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 128. [2024-11-12 01:11:17,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 96 states have internal predecessors, (137), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 01:11:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 197 transitions. [2024-11-12 01:11:17,562 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 197 transitions. Word has length 166 [2024-11-12 01:11:17,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:11:17,563 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 197 transitions. [2024-11-12 01:11:17,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:11:17,563 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 197 transitions. [2024-11-12 01:11:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-12 01:11:17,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:11:17,565 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:11:17,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 01:11:17,565 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:11:17,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:11:17,566 INFO L85 PathProgramCache]: Analyzing trace with hash -326658262, now seen corresponding path program 1 times [2024-11-12 01:11:17,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:11:17,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781118244] [2024-11-12 01:11:17,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:11:17,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:11:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:11:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:11:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:11:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:11:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:11:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:11:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:11:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:11:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:11:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:11:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:11:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:11:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:11:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:11:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:11:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 01:11:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:11:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:11:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:11:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:11:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:11:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:11:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:11:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:11:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 01:11:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 01:11:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:11:19,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:11:19,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781118244] [2024-11-12 01:11:19,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781118244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:11:19,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:11:19,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 01:11:19,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102210049] [2024-11-12 01:11:19,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:11:19,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 01:11:19,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:11:19,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 01:11:19,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 01:11:19,203 INFO L87 Difference]: Start difference. First operand 128 states and 197 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:11:19,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:11:19,749 INFO L93 Difference]: Finished difference Result 359 states and 545 transitions. [2024-11-12 01:11:19,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 01:11:19,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-11-12 01:11:19,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:11:19,752 INFO L225 Difference]: With dead ends: 359 [2024-11-12 01:11:19,752 INFO L226 Difference]: Without dead ends: 234 [2024-11-12 01:11:19,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-12 01:11:19,753 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 172 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 01:11:19,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 403 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 01:11:19,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-12 01:11:19,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 134. [2024-11-12 01:11:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 101 states have (on average 1.4554455445544554) internal successors, (147), 102 states have internal predecessors, (147), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 01:11:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 207 transitions. [2024-11-12 01:11:19,768 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 207 transitions. Word has length 166 [2024-11-12 01:11:19,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:11:19,768 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 207 transitions. [2024-11-12 01:11:19,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:11:19,768 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 207 transitions. [2024-11-12 01:11:19,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-12 01:11:19,771 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:11:19,771 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:11:19,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 01:11:19,771 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:11:19,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:11:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1337775512, now seen corresponding path program 1 times [2024-11-12 01:11:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:11:19,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627370005] [2024-11-12 01:11:19,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:11:19,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:11:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:11:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:11:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:11:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:11:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:11:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:11:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:11:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:11:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:11:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:11:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:11:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:11:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:11:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:11:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:11:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 01:11:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:11:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:11:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:11:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:11:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:11:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:11:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:11:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:11:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 01:11:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 01:11:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:11:20,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:11:20,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627370005] [2024-11-12 01:11:20,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627370005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:11:20,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:11:20,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 01:11:20,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984172060] [2024-11-12 01:11:20,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:11:20,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 01:11:20,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:11:20,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 01:11:20,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 01:11:20,342 INFO L87 Difference]: Start difference. First operand 134 states and 207 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:11:20,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:11:20,590 INFO L93 Difference]: Finished difference Result 303 states and 461 transitions. [2024-11-12 01:11:20,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 01:11:20,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-11-12 01:11:20,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:11:20,595 INFO L225 Difference]: With dead ends: 303 [2024-11-12 01:11:20,595 INFO L226 Difference]: Without dead ends: 172 [2024-11-12 01:11:20,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-12 01:11:20,596 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 64 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:11:20,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 467 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:11:20,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-12 01:11:20,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 121. [2024-11-12 01:11:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 89 states have internal predecessors, (125), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 01:11:20,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 185 transitions. [2024-11-12 01:11:20,609 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 185 transitions. Word has length 166 [2024-11-12 01:11:20,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:11:20,609 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 185 transitions. [2024-11-12 01:11:20,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:11:20,610 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 185 transitions. [2024-11-12 01:11:20,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 01:11:20,611 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:11:20,611 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:11:20,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 01:11:20,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:11:20,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:11:20,611 INFO L85 PathProgramCache]: Analyzing trace with hash 776175152, now seen corresponding path program 1 times [2024-11-12 01:11:20,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:11:20,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634962284] [2024-11-12 01:11:20,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:11:20,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:11:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:11:20,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1753863482] [2024-11-12 01:11:20,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:11:20,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:11:20,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:11:20,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 01:11:20,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 01:11:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:11:20,995 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 01:11:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:11:21,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 01:11:21,094 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 01:11:21,095 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 01:11:21,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 01:11:21,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:11:21,300 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:11:21,382 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 01:11:21,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:11:21 BoogieIcfgContainer [2024-11-12 01:11:21,386 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 01:11:21,386 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 01:11:21,386 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 01:11:21,386 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 01:11:21,387 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:11:09" (3/4) ... [2024-11-12 01:11:21,388 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 01:11:21,389 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 01:11:21,389 INFO L158 Benchmark]: Toolchain (without parser) took 12398.48ms. Allocated memory was 176.2MB in the beginning and 604.0MB in the end (delta: 427.8MB). Free memory was 145.3MB in the beginning and 367.7MB in the end (delta: -222.4MB). Peak memory consumption was 204.9MB. Max. memory is 16.1GB. [2024-11-12 01:11:21,389 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:11:21,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.93ms. Allocated memory is still 176.2MB. Free memory was 145.1MB in the beginning and 135.1MB in the end (delta: 10.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 01:11:21,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.42ms. Allocated memory is still 176.2MB. Free memory was 135.1MB in the beginning and 132.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 01:11:21,390 INFO L158 Benchmark]: Boogie Preprocessor took 37.74ms. Allocated memory is still 176.2MB. Free memory was 132.1MB in the beginning and 128.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 01:11:21,390 INFO L158 Benchmark]: RCFGBuilder took 470.14ms. Allocated memory is still 176.2MB. Free memory was 128.9MB in the beginning and 130.5MB in the end (delta: -1.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 01:11:21,390 INFO L158 Benchmark]: TraceAbstraction took 11555.83ms. Allocated memory was 176.2MB in the beginning and 604.0MB in the end (delta: 427.8MB). Free memory was 129.5MB in the beginning and 368.8MB in the end (delta: -239.3MB). Peak memory consumption was 190.6MB. Max. memory is 16.1GB. [2024-11-12 01:11:21,390 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 604.0MB. Free memory was 368.8MB in the beginning and 367.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 01:11:21,391 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.16ms. Allocated memory is still 176.2MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.93ms. Allocated memory is still 176.2MB. Free memory was 145.1MB in the beginning and 135.1MB in the end (delta: 10.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.42ms. Allocated memory is still 176.2MB. Free memory was 135.1MB in the beginning and 132.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.74ms. Allocated memory is still 176.2MB. Free memory was 132.1MB in the beginning and 128.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 470.14ms. Allocated memory is still 176.2MB. Free memory was 128.9MB in the beginning and 130.5MB in the end (delta: -1.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11555.83ms. Allocated memory was 176.2MB in the beginning and 604.0MB in the end (delta: 427.8MB). Free memory was 129.5MB in the beginning and 368.8MB in the end (delta: -239.3MB). Peak memory consumption was 190.6MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 604.0MB. Free memory was 368.8MB in the beginning and 367.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 133. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -50; [L23] signed short int var_1_2 = 10000; [L24] signed long int var_1_3 = 64; [L25] unsigned char var_1_4 = 0; [L26] signed short int var_1_5 = 8; [L27] signed short int var_1_6 = 64; [L28] unsigned short int var_1_7 = 8; [L29] unsigned short int var_1_8 = 256; [L30] signed long int var_1_9 = 2; [L31] signed long int var_1_10 = 1441729073; [L32] unsigned short int var_1_11 = 32; [L33] double var_1_12 = 7.6; [L34] double var_1_13 = 127.8; [L35] signed char var_1_14 = 32; [L36] signed char var_1_15 = 50; [L37] signed char var_1_16 = 0; [L38] signed char var_1_17 = 16; [L39] float var_1_18 = 0.4; [L40] unsigned char var_1_19 = 0; [L41] float var_1_20 = 24.4; [L42] float var_1_21 = 500.5; [L43] float var_1_22 = 99.324; [L44] unsigned short int var_1_23 = 128; VAL [isInitial=0, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=10000, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] FCALL updateLastVariables() [L141] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_short() [L89] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L89] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L90] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L90] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L91] var_1_3 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L92] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L93] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L93] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L94] var_1_4 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L95] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L96] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L96] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L97] var_1_5 = __VERIFIER_nondet_short() [L98] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L98] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L99] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L99] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L100] var_1_6 = __VERIFIER_nondet_short() [L101] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=256, var_1_9=2] [L101] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=256, var_1_9=2] [L102] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=256, var_1_9=2] [L102] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=256, var_1_9=2] [L103] var_1_8 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_9=2] [L104] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_9=2] [L105] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L105] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L106] var_1_10 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_10 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L107] RET assume_abort_if_not(var_1_10 >= 1073741823) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L108] CALL assume_abort_if_not(var_1_10 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L108] RET assume_abort_if_not(var_1_10 <= 2147483646) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L109] var_1_13 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L110] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L111] var_1_15 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L112] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L113] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L113] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L114] var_1_16 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L115] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L116] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L116] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L117] var_1_17 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L118] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L119] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L119] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L120] var_1_19 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L121] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L122] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L122] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L123] var_1_20 = __VERIFIER_nondet_float() [L124] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L124] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L125] var_1_21 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L126] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L127] var_1_22 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L128] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L141] RET updateVariables() [L142] CALL step() [L48] COND FALSE !((var_1_2 / -50) >= var_1_3) [L55] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8, var_1_8=0, var_1_9=2] [L57] COND TRUE var_1_2 < var_1_6 [L58] var_1_7 = (var_1_6 + var_1_8) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=2] [L60] COND FALSE !(var_1_6 > 128) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=2] [L63] EXPR var_1_5 | var_1_6 VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=2] [L63] COND FALSE !(((var_1_7 + var_1_9) * var_1_3) < (var_1_5 | var_1_6)) [L68] var_1_11 = var_1_8 VAL [isInitial=1, var_1_10=1073741823, var_1_11=0, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=2] [L70] COND FALSE !(var_1_11 < (- var_1_10)) [L75] var_1_12 = var_1_13 VAL [isInitial=1, var_1_10=1073741823, var_1_11=0, var_1_12=2, var_1_13=2, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=2] [L77] COND TRUE var_1_1 <= var_1_8 [L78] var_1_14 = ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2) VAL [isInitial=1, var_1_10=1073741823, var_1_11=0, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=2] [L80] COND FALSE !(var_1_4 || var_1_19) VAL [isInitial=1, var_1_10=1073741823, var_1_11=0, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=2] [L83] COND FALSE !(var_1_4 && (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) > var_1_5)) VAL [isInitial=1, var_1_10=1073741823, var_1_11=0, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=2] [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (((((var_1_2 / -50) >= var_1_3) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_2 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_7)))) : 1)) && ((((var_1_7 + var_1_9) * var_1_3) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, var_1_10=1073741823, var_1_11=0, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=2] [L133] EXPR var_1_5 | var_1_6 VAL [isInitial=1, var_1_10=1073741823, var_1_11=0, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=2] [L133] EXPR (((((var_1_2 / -50) >= var_1_3) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_2 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_7)))) : 1)) && ((((var_1_7 + var_1_9) * var_1_3) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, var_1_10=1073741823, var_1_11=0, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=2] [L133-L134] return (((((((((var_1_2 / -50) >= var_1_3) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_2 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_7)))) : 1)) && ((((var_1_7 + var_1_9) * var_1_3) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8)))) && ((var_1_11 < (- var_1_10)) ? ((var_1_8 <= var_1_2) ? (var_1_12 == ((double) (var_1_13 - 63.75))) : 1) : (var_1_12 == ((double) var_1_13)))) && ((var_1_1 <= var_1_8) ? (var_1_14 == ((signed char) ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2))) : 1)) && ((var_1_4 || var_1_19) ? (var_1_18 == ((float) ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))))) : 1)) && ((var_1_4 && (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) > var_1_5)) ? (var_1_23 == ((unsigned short int) var_1_6)) : 1) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1073741823, var_1_11=0, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=1073741823, var_1_11=0, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 8, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 473 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 473 mSDsluCounter, 2118 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1278 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 905 IncrementalHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 840 mSDtfsCounter, 905 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 436 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=3, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 290 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 1492 NumberOfCodeBlocks, 1492 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1151 ConstructedInterpolants, 0 QuantifiedInterpolants, 7451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 9100/9100 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-11-12 01:11:21,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4edfcd6a0e29414c9c789482fc7cedb09715c187ed4e164b3ba4e4f923719adc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:11:23,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:11:23,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 01:11:23,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:11:23,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:11:23,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:11:23,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:11:23,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:11:23,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:11:23,367 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:11:23,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:11:23,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:11:23,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:11:23,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:11:23,368 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:11:23,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:11:23,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:11:23,369 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:11:23,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:11:23,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:11:23,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:11:23,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:11:23,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:11:23,372 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 01:11:23,373 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 01:11:23,373 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:11:23,373 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 01:11:23,373 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:11:23,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:11:23,373 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:11:23,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:11:23,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:11:23,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:11:23,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:11:23,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:11:23,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:11:23,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:11:23,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:11:23,377 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 01:11:23,377 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 01:11:23,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:11:23,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:11:23,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:11:23,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:11:23,379 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4edfcd6a0e29414c9c789482fc7cedb09715c187ed4e164b3ba4e4f923719adc [2024-11-12 01:11:23,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:11:23,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:11:23,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:11:23,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:11:23,654 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:11:23,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i [2024-11-12 01:11:24,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:11:25,065 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:11:25,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i [2024-11-12 01:11:25,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5feca229/5f4f43ac2d1a4a80b5ae2950841a6388/FLAG886cc2186 [2024-11-12 01:11:25,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5feca229/5f4f43ac2d1a4a80b5ae2950841a6388 [2024-11-12 01:11:25,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:11:25,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:11:25,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:11:25,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:11:25,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:11:25,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:11:25" (1/1) ... [2024-11-12 01:11:25,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d5cc100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:25, skipping insertion in model container [2024-11-12 01:11:25,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:11:25" (1/1) ... [2024-11-12 01:11:25,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:11:25,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i[913,926] [2024-11-12 01:11:25,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:11:25,694 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:11:25,713 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-16.i[913,926] [2024-11-12 01:11:25,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:11:25,768 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:11:25,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:25 WrapperNode [2024-11-12 01:11:25,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:11:25,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:11:25,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:11:25,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:11:25,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:25" (1/1) ... [2024-11-12 01:11:25,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:25" (1/1) ... [2024-11-12 01:11:25,818 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2024-11-12 01:11:25,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:11:25,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:11:25,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:11:25,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:11:25,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:25" (1/1) ... [2024-11-12 01:11:25,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:25" (1/1) ... [2024-11-12 01:11:25,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:25" (1/1) ... [2024-11-12 01:11:25,853 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:11:25,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:25" (1/1) ... [2024-11-12 01:11:25,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:25" (1/1) ... [2024-11-12 01:11:25,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:25" (1/1) ... [2024-11-12 01:11:25,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:25" (1/1) ... [2024-11-12 01:11:25,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:25" (1/1) ... [2024-11-12 01:11:25,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:25" (1/1) ... [2024-11-12 01:11:25,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:11:25,879 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:11:25,879 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:11:25,879 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:11:25,879 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:25" (1/1) ... [2024-11-12 01:11:25,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:11:25,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:11:25,910 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:11:25,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:11:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:11:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 01:11:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:11:25,947 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:11:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:11:25,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:11:26,019 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:11:26,020 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:11:27,085 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 01:11:27,086 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:11:27,096 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:11:27,096 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:11:27,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:11:27 BoogieIcfgContainer [2024-11-12 01:11:27,096 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:11:27,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:11:27,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:11:27,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:11:27,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:11:25" (1/3) ... [2024-11-12 01:11:27,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128b972b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:11:27, skipping insertion in model container [2024-11-12 01:11:27,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:25" (2/3) ... [2024-11-12 01:11:27,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128b972b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:11:27, skipping insertion in model container [2024-11-12 01:11:27,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:11:27" (3/3) ... [2024-11-12 01:11:27,107 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-16.i [2024-11-12 01:11:27,119 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:11:27,119 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:11:27,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:11:27,177 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;@38e4350, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:11:27,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:11:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:11:27,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 01:11:27,192 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:11:27,193 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:11:27,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:11:27,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:11:27,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1650338705, now seen corresponding path program 1 times [2024-11-12 01:11:27,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:11:27,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776653537] [2024-11-12 01:11:27,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:11:27,211 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-11-12 01:11:27,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:11:27,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-11-12 01:11:27,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-12 01:11:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:27,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 01:11:27,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:11:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2024-11-12 01:11:27,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:11:27,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:11:27,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776653537] [2024-11-12 01:11:27,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776653537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:11:27,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:11:27,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:11:27,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155731465] [2024-11-12 01:11:27,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:11:27,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:11:27,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:11:27,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:11:27,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:11:27,657 INFO L87 Difference]: Start difference. First operand has 71 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 01:11:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:11:27,678 INFO L93 Difference]: Finished difference Result 135 states and 240 transitions. [2024-11-12 01:11:27,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:11:27,680 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 162 [2024-11-12 01:11:27,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:11:27,685 INFO L225 Difference]: With dead ends: 135 [2024-11-12 01:11:27,685 INFO L226 Difference]: Without dead ends: 67 [2024-11-12 01:11:27,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:11:27,693 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:11:27,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:11:27,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-12 01:11:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-12 01:11:27,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:11:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2024-11-12 01:11:27,735 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 162 [2024-11-12 01:11:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:11:27,735 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2024-11-12 01:11:27,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 01:11:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2024-11-12 01:11:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 01:11:27,738 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:11:27,738 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:11:27,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-11-12 01:11:27,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-11-12 01:11:27,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:11:27,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:11:27,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1441074505, now seen corresponding path program 1 times [2024-11-12 01:11:27,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:11:27,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324973924] [2024-11-12 01:11:27,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:11:27,952 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-11-12 01:11:27,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:11:27,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-11-12 01:11:27,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-12 01:11:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:28,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 01:11:28,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:12:09,206 WARN L286 SmtUtils]: Spent 10.15s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-12 01:12:39,446 WARN L286 SmtUtils]: Spent 9.74s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)