./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.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 c09ae5383c303ea70fa8be3591cb19f07b66ade63b6f0323637dd7a8d6da530f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:06:08,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:06:08,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:06:08,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:06:08,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:06:08,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:06:08,924 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:06:08,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:06:08,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:06:08,929 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:06:08,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:06:08,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:06:08,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:06:08,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:06:08,930 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:06:08,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:06:08,931 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:06:08,931 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:06:08,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:06:08,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:06:08,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:06:08,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:06:08,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:06:08,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:06:08,940 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:06:08,940 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:06:08,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:06:08,940 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:06:08,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:06:08,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:06:08,941 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:06:08,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:06:08,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:06:08,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:06:08,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:06:08,942 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:06:08,942 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:06:08,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:06:08,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:06:08,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:06:08,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:06:08,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:06:08,950 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 -> c09ae5383c303ea70fa8be3591cb19f07b66ade63b6f0323637dd7a8d6da530f [2024-10-13 01:06:09,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:06:09,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:06:09,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:06:09,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:06:09,342 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:06:09,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i [2024-10-13 01:06:10,794 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:06:10,963 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:06:10,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i [2024-10-13 01:06:10,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/891086dec/5ad3f1e5beb241a0a7d11b3c7175e0b8/FLAG59c3688fd [2024-10-13 01:06:10,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/891086dec/5ad3f1e5beb241a0a7d11b3c7175e0b8 [2024-10-13 01:06:10,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:06:10,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:06:10,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:06:10,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:06:11,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:06:11,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:06:10" (1/1) ... [2024-10-13 01:06:11,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58eadd79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:11, skipping insertion in model container [2024-10-13 01:06:11,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:06:10" (1/1) ... [2024-10-13 01:06:11,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:06:11,160 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i[915,928] [2024-10-13 01:06:11,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:06:11,211 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:06:11,221 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i[915,928] [2024-10-13 01:06:11,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:06:11,262 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:06:11,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:11 WrapperNode [2024-10-13 01:06:11,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:06:11,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:06:11,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:06:11,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:06:11,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:11" (1/1) ... [2024-10-13 01:06:11,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:11" (1/1) ... [2024-10-13 01:06:11,313 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2024-10-13 01:06:11,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:06:11,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:06:11,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:06:11,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:06:11,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:11" (1/1) ... [2024-10-13 01:06:11,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:11" (1/1) ... [2024-10-13 01:06:11,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:11" (1/1) ... [2024-10-13 01:06:11,342 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 01:06:11,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:11" (1/1) ... [2024-10-13 01:06:11,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:11" (1/1) ... [2024-10-13 01:06:11,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:11" (1/1) ... [2024-10-13 01:06:11,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:11" (1/1) ... [2024-10-13 01:06:11,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:11" (1/1) ... [2024-10-13 01:06:11,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:11" (1/1) ... [2024-10-13 01:06:11,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:06:11,365 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:06:11,365 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:06:11,365 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:06:11,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:11" (1/1) ... [2024-10-13 01:06:11,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:06:11,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:06:11,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 01:06:11,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 01:06:11,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:06:11,447 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:06:11,447 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:06:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:06:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:06:11,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:06:11,539 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:06:11,541 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:06:11,840 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 01:06:11,840 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:06:11,870 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:06:11,871 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:06:11,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:06:11 BoogieIcfgContainer [2024-10-13 01:06:11,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:06:11,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:06:11,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:06:11,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:06:11,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:06:10" (1/3) ... [2024-10-13 01:06:11,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6adbd38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:06:11, skipping insertion in model container [2024-10-13 01:06:11,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:11" (2/3) ... [2024-10-13 01:06:11,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6adbd38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:06:11, skipping insertion in model container [2024-10-13 01:06:11,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:06:11" (3/3) ... [2024-10-13 01:06:11,883 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-38.i [2024-10-13 01:06:11,895 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:06:11,895 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:06:11,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:06:11,959 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;@4124b1d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:06:11,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:06:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 01:06:11,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-13 01:06:11,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:11,988 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:11,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:11,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:11,994 INFO L85 PathProgramCache]: Analyzing trace with hash 358862912, now seen corresponding path program 1 times [2024-10-13 01:06:12,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:06:12,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398200892] [2024-10-13 01:06:12,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:12,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:06:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:06:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:06:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:06:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:06:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:06:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:06:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:06:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:06:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:06:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:06:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:06:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:06:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 01:06:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:06:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 01:06:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 01:06:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 01:06:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 01:06:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:06:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:06:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:06:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:06:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:06:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:06:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:06:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:06:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:06:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:06:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 01:06:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:06:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:06:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:06:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 01:06:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 01:06:12,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:06:12,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398200892] [2024-10-13 01:06:12,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398200892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:06:12,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:06:12,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:06:12,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30455532] [2024-10-13 01:06:12,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:06:12,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:06:12,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:06:12,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:06:12,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:06:12,427 INFO L87 Difference]: Start difference. First operand has 90 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 01:06:12,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:12,466 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2024-10-13 01:06:12,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:06:12,484 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 203 [2024-10-13 01:06:12,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:12,492 INFO L225 Difference]: With dead ends: 177 [2024-10-13 01:06:12,492 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 01:06:12,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:06:12,498 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:12,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:06:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 01:06:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-13 01:06:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 01:06:12,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 140 transitions. [2024-10-13 01:06:12,564 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 140 transitions. Word has length 203 [2024-10-13 01:06:12,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:12,565 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 140 transitions. [2024-10-13 01:06:12,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 01:06:12,566 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 140 transitions. [2024-10-13 01:06:12,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-13 01:06:12,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:12,572 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:12,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:06:12,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:12,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:12,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1851500554, now seen corresponding path program 1 times [2024-10-13 01:06:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:06:12,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404569629] [2024-10-13 01:06:12,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:12,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:06:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:06:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:06:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:06:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:06:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:06:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:06:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:06:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:06:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:06:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:06:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:06:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:06:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 01:06:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:06:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 01:06:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 01:06:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 01:06:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 01:06:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:06:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:06:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:06:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:06:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:06:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:06:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:06:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:06:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:06:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:06:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 01:06:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:06:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:06:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:06:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 01:06:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 01:06:13,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:06:13,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404569629] [2024-10-13 01:06:13,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404569629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:06:13,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:06:13,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 01:06:13,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952052185] [2024-10-13 01:06:13,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:06:13,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:06:13,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:06:13,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:06:13,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:06:13,303 INFO L87 Difference]: Start difference. First operand 88 states and 140 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 01:06:13,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:13,525 INFO L93 Difference]: Finished difference Result 344 states and 548 transitions. [2024-10-13 01:06:13,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 01:06:13,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 203 [2024-10-13 01:06:13,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:13,529 INFO L225 Difference]: With dead ends: 344 [2024-10-13 01:06:13,529 INFO L226 Difference]: Without dead ends: 257 [2024-10-13 01:06:13,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:06:13,531 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 336 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:13,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 534 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:06:13,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-10-13 01:06:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 173. [2024-10-13 01:06:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 104 states have internal predecessors, (145), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 01:06:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 277 transitions. [2024-10-13 01:06:13,575 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 277 transitions. Word has length 203 [2024-10-13 01:06:13,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:13,577 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 277 transitions. [2024-10-13 01:06:13,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 01:06:13,577 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 277 transitions. [2024-10-13 01:06:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-13 01:06:13,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:13,582 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:13,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 01:06:13,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:13,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash -48923620, now seen corresponding path program 1 times [2024-10-13 01:06:13,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:06:13,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999436905] [2024-10-13 01:06:13,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:06:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:06:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:06:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:06:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:06:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:06:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:06:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:06:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:06:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:06:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:06:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:06:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:06:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 01:06:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:06:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 01:06:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 01:06:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 01:06:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 01:06:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:06:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:06:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:06:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:06:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:06:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:06:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:06:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:06:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:06:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:06:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 01:06:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:06:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:06:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:06:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 01:06:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 01:06:13,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:06:13,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999436905] [2024-10-13 01:06:13,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999436905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:06:13,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:06:13,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 01:06:13,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802223027] [2024-10-13 01:06:13,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:06:13,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:06:13,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:06:13,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:06:13,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:06:13,987 INFO L87 Difference]: Start difference. First operand 173 states and 277 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 01:06:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:14,224 INFO L93 Difference]: Finished difference Result 553 states and 885 transitions. [2024-10-13 01:06:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 01:06:14,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2024-10-13 01:06:14,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:14,228 INFO L225 Difference]: With dead ends: 553 [2024-10-13 01:06:14,228 INFO L226 Difference]: Without dead ends: 381 [2024-10-13 01:06:14,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:06:14,230 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 122 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:14,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 476 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:06:14,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-13 01:06:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 345. [2024-10-13 01:06:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 208 states have (on average 1.3942307692307692) internal successors, (290), 208 states have internal predecessors, (290), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-10-13 01:06:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 554 transitions. [2024-10-13 01:06:14,313 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 554 transitions. Word has length 204 [2024-10-13 01:06:14,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:14,313 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 554 transitions. [2024-10-13 01:06:14,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 01:06:14,314 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 554 transitions. [2024-10-13 01:06:14,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-13 01:06:14,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:14,317 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:14,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 01:06:14,317 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:14,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:14,318 INFO L85 PathProgramCache]: Analyzing trace with hash -635729634, now seen corresponding path program 1 times [2024-10-13 01:06:14,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:06:14,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708482566] [2024-10-13 01:06:14,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:14,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:06:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:06:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:06:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:06:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:06:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:06:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:06:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:06:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:06:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:06:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:06:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:06:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:06:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 01:06:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:06:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 01:06:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 01:06:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 01:06:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 01:06:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:06:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:06:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:06:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:06:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:06:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:06:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:06:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:06:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:06:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:06:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 01:06:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:06:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:06:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:06:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 01:06:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-13 01:06:14,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:06:14,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708482566] [2024-10-13 01:06:14,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708482566] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:06:14,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139333513] [2024-10-13 01:06:14,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:14,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:06:14,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:06:14,678 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:06:14,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 01:06:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:14,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 01:06:14,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:06:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 32 proven. 96 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:06:15,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:06:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-13 01:06:15,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139333513] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:06:15,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:06:15,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-13 01:06:15,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644409800] [2024-10-13 01:06:15,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:06:15,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 01:06:15,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:06:15,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 01:06:15,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:06:15,432 INFO L87 Difference]: Start difference. First operand 345 states and 554 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2024-10-13 01:06:15,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:15,622 INFO L93 Difference]: Finished difference Result 611 states and 967 transitions. [2024-10-13 01:06:15,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 01:06:15,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) Word has length 204 [2024-10-13 01:06:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:15,625 INFO L225 Difference]: With dead ends: 611 [2024-10-13 01:06:15,625 INFO L226 Difference]: Without dead ends: 267 [2024-10-13 01:06:15,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 470 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-13 01:06:15,627 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 81 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:15,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 229 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:06:15,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-13 01:06:15,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 259. [2024-10-13 01:06:15,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 153 states have (on average 1.3333333333333333) internal successors, (204), 153 states have internal predecessors, (204), 99 states have call successors, (99), 6 states have call predecessors, (99), 6 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-13 01:06:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 402 transitions. [2024-10-13 01:06:15,649 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 402 transitions. Word has length 204 [2024-10-13 01:06:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:15,650 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 402 transitions. [2024-10-13 01:06:15,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2024-10-13 01:06:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 402 transitions. [2024-10-13 01:06:15,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-13 01:06:15,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:15,652 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:15,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 01:06:15,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:06:15,853 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:15,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:15,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1315788004, now seen corresponding path program 1 times [2024-10-13 01:06:15,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:06:15,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479378546] [2024-10-13 01:06:15,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:15,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:06:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:06:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:06:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:06:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:06:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:06:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:06:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:06:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:06:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:06:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:06:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:06:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:06:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 01:06:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:06:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 01:06:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 01:06:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 01:06:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 01:06:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:06:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:06:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:06:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:06:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:06:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:06:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:06:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:06:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:06:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:06:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 01:06:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:06:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:06:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:06:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 01:06:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-13 01:06:16,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:06:16,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479378546] [2024-10-13 01:06:16,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479378546] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:06:16,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106360105] [2024-10-13 01:06:16,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:16,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:06:16,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:06:16,265 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:06:16,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 01:06:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:16,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 01:06:16,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:06:16,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2024-10-13 01:06:16,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:06:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-13 01:06:17,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106360105] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:06:17,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:06:17,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2024-10-13 01:06:17,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836541415] [2024-10-13 01:06:17,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:06:17,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 01:06:17,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:06:17,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 01:06:17,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-13 01:06:17,351 INFO L87 Difference]: Start difference. First operand 259 states and 402 transitions. Second operand has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 6 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 6 states have call successors, (99) [2024-10-13 01:06:18,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:18,054 INFO L93 Difference]: Finished difference Result 520 states and 792 transitions. [2024-10-13 01:06:18,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 01:06:18,055 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 6 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 6 states have call successors, (99) Word has length 204 [2024-10-13 01:06:18,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:18,057 INFO L225 Difference]: With dead ends: 520 [2024-10-13 01:06:18,057 INFO L226 Difference]: Without dead ends: 333 [2024-10-13 01:06:18,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=493, Unknown=0, NotChecked=0, Total=702 [2024-10-13 01:06:18,059 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 493 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:18,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 580 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 01:06:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-13 01:06:18,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 279. [2024-10-13 01:06:18,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 171 states have (on average 1.3391812865497077) internal successors, (229), 171 states have internal predecessors, (229), 99 states have call successors, (99), 8 states have call predecessors, (99), 8 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-13 01:06:18,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 427 transitions. [2024-10-13 01:06:18,084 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 427 transitions. Word has length 204 [2024-10-13 01:06:18,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:18,085 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 427 transitions. [2024-10-13 01:06:18,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 6 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 6 states have call successors, (99) [2024-10-13 01:06:18,085 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 427 transitions. [2024-10-13 01:06:18,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-13 01:06:18,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:18,086 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:18,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 01:06:18,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:06:18,287 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:18,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:18,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2115698682, now seen corresponding path program 1 times [2024-10-13 01:06:18,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:06:18,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759722209] [2024-10-13 01:06:18,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:18,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:06:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:06:18,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526438259] [2024-10-13 01:06:18,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:18,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:06:18,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:06:18,335 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:06:18,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 01:06:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:18,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 01:06:18,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:06:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 1746 trivial. 0 not checked. [2024-10-13 01:06:18,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:06:18,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:06:18,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759722209] [2024-10-13 01:06:18,735 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 01:06:18,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526438259] [2024-10-13 01:06:18,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526438259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:06:18,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:06:18,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 01:06:18,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730128058] [2024-10-13 01:06:18,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:06:18,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 01:06:18,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:06:18,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 01:06:18,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 01:06:18,737 INFO L87 Difference]: Start difference. First operand 279 states and 427 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 01:06:19,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:19,243 INFO L93 Difference]: Finished difference Result 721 states and 1093 transitions. [2024-10-13 01:06:19,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 01:06:19,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 205 [2024-10-13 01:06:19,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:19,247 INFO L225 Difference]: With dead ends: 721 [2024-10-13 01:06:19,247 INFO L226 Difference]: Without dead ends: 515 [2024-10-13 01:06:19,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-13 01:06:19,248 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 215 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:19,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 612 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 01:06:19,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-13 01:06:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 501. [2024-10-13 01:06:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 319 states have (on average 1.347962382445141) internal successors, (430), 319 states have internal predecessors, (430), 165 states have call successors, (165), 16 states have call predecessors, (165), 16 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2024-10-13 01:06:19,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 760 transitions. [2024-10-13 01:06:19,281 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 760 transitions. Word has length 205 [2024-10-13 01:06:19,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:19,281 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 760 transitions. [2024-10-13 01:06:19,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 01:06:19,281 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 760 transitions. [2024-10-13 01:06:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-13 01:06:19,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:19,283 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:19,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 01:06:19,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:06:19,484 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:19,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:19,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1094630328, now seen corresponding path program 1 times [2024-10-13 01:06:19,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:06:19,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676475787] [2024-10-13 01:06:19,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:19,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:06:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:06:19,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [411281660] [2024-10-13 01:06:19,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:19,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:06:19,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:06:19,531 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:06:19,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 01:06:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:06:19,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 01:06:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:06:19,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 01:06:19,785 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 01:06:19,786 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 01:06:19,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 01:06:19,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:06:19,991 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:20,103 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 01:06:20,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:06:20 BoogieIcfgContainer [2024-10-13 01:06:20,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 01:06:20,106 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 01:06:20,106 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 01:06:20,106 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 01:06:20,107 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:06:11" (3/4) ... [2024-10-13 01:06:20,108 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 01:06:20,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 01:06:20,109 INFO L158 Benchmark]: Toolchain (without parser) took 9116.31ms. Allocated memory was 151.0MB in the beginning and 327.2MB in the end (delta: 176.2MB). Free memory was 80.4MB in the beginning and 268.3MB in the end (delta: -188.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:06:20,110 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 151.0MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:06:20,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.17ms. Allocated memory is still 151.0MB. Free memory was 80.4MB in the beginning and 64.3MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 01:06:20,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.39ms. Allocated memory is still 151.0MB. Free memory was 64.3MB in the beginning and 61.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 01:06:20,110 INFO L158 Benchmark]: Boogie Preprocessor took 50.51ms. Allocated memory is still 151.0MB. Free memory was 61.3MB in the beginning and 58.0MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 01:06:20,110 INFO L158 Benchmark]: RCFGBuilder took 510.63ms. Allocated memory was 151.0MB in the beginning and 224.4MB in the end (delta: 73.4MB). Free memory was 58.0MB in the beginning and 176.2MB in the end (delta: -118.2MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2024-10-13 01:06:20,111 INFO L158 Benchmark]: TraceAbstraction took 8228.62ms. Allocated memory was 224.4MB in the beginning and 327.2MB in the end (delta: 102.8MB). Free memory was 176.2MB in the beginning and 268.3MB in the end (delta: -92.1MB). Peak memory consumption was 147.4MB. Max. memory is 16.1GB. [2024-10-13 01:06:20,111 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 327.2MB. Free memory is still 268.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:06:20,112 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.10ms. Allocated memory is still 151.0MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.17ms. Allocated memory is still 151.0MB. Free memory was 80.4MB in the beginning and 64.3MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.39ms. Allocated memory is still 151.0MB. Free memory was 64.3MB in the beginning and 61.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.51ms. Allocated memory is still 151.0MB. Free memory was 61.3MB in the beginning and 58.0MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 510.63ms. Allocated memory was 151.0MB in the beginning and 224.4MB in the end (delta: 73.4MB). Free memory was 58.0MB in the beginning and 176.2MB in the end (delta: -118.2MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8228.62ms. Allocated memory was 224.4MB in the beginning and 327.2MB in the end (delta: 102.8MB). Free memory was 176.2MB in the beginning and 268.3MB in the end (delta: -92.1MB). Peak memory consumption was 147.4MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 327.2MB. Free memory is still 268.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 180, overapproximation of shiftRight at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 0; [L26] unsigned short int var_1_8 = 4; [L27] signed long int var_1_11 = 100; [L28] signed long int var_1_12 = 8; [L29] unsigned short int var_1_13 = 128; [L30] double var_1_14 = 64.5; [L31] signed short int var_1_15 = 4; [L32] signed long int var_1_16 = -8; [L33] double var_1_17 = 255.5; [L34] double var_1_18 = 0.6; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 999999.25; [L37] signed short int var_1_21 = -64; [L38] signed char var_1_25 = -128; [L39] signed char var_1_26 = -8; [L40] unsigned char var_1_27 = 32; [L41] double var_1_28 = 7.7; [L42] double var_1_29 = 127.8; [L43] unsigned char var_1_30 = 1; [L44] signed long int var_1_31 = -16; [L45] unsigned char var_1_32 = 0; [L46] unsigned short int var_1_33 = 128; [L47] signed short int var_1_34 = 50; [L48] unsigned short int var_1_35 = 10000; [L49] unsigned long int var_1_36 = 128; [L50] signed char var_1_37 = 2; [L51] unsigned short int last_1_var_1_8 = 4; [L52] signed short int last_1_var_1_21 = -64; [L53] signed char last_1_var_1_25 = -128; [L184] isInitial = 1 [L185] FCALL initially() [L186] COND TRUE 1 [L187] CALL updateLastVariables() [L175] last_1_var_1_8 = var_1_8 [L176] last_1_var_1_21 = var_1_21 [L177] last_1_var_1_25 = var_1_25 [L187] RET updateLastVariables() [L188] CALL updateVariables() [L122] var_1_4 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L123] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L124] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L124] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L125] var_1_6 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_7=0, var_1_8=4] [L126] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_7=0, var_1_8=4] [L127] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L127] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L128] var_1_11 = __VERIFIER_nondet_long() [L129] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L129] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L130] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L130] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L131] var_1_12 = __VERIFIER_nondet_long() [L132] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L132] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L133] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L133] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L134] var_1_13 = __VERIFIER_nondet_ushort() [L135] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L135] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L136] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L136] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L137] var_1_15 = __VERIFIER_nondet_short() [L138] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L138] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L139] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L139] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L140] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L140] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L141] var_1_16 = __VERIFIER_nondet_long() [L142] CALL assume_abort_if_not(var_1_16 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L142] RET assume_abort_if_not(var_1_16 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L143] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L143] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L144] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L144] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L145] var_1_17 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L146] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L147] var_1_18 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L148] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L149] var_1_19 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L150] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L151] var_1_20 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L152] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L153] var_1_26 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L154] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L155] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L155] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L156] var_1_28 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L157] RET assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L158] var_1_29 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L159] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L160] var_1_31 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_31 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L161] RET assume_abort_if_not(var_1_31 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L162] CALL assume_abort_if_not(var_1_31 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L162] RET assume_abort_if_not(var_1_31 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L163] var_1_32 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L164] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L165] CALL assume_abort_if_not(var_1_32 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L165] RET assume_abort_if_not(var_1_32 <= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L166] var_1_34 = __VERIFIER_nondet_short() [L167] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L167] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L168] CALL assume_abort_if_not(var_1_34 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L168] RET assume_abort_if_not(var_1_34 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L169] var_1_37 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_37 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L170] RET assume_abort_if_not(var_1_37 >= -128) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L171] CALL assume_abort_if_not(var_1_37 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L171] RET assume_abort_if_not(var_1_37 <= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L172] CALL assume_abort_if_not(var_1_37 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L172] RET assume_abort_if_not(var_1_37 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L188] RET updateVariables() [L189] CALL step() [L57] COND FALSE !(0.75 <= var_1_28) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L62] COND TRUE (~ var_1_27) < var_1_31 [L63] var_1_30 = var_1_32 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L65] COND FALSE !(\read(var_1_32)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L76] var_1_35 = var_1_27 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L77] COND FALSE !((-1 / var_1_37) >= ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L80] EXPR last_1_var_1_8 >> var_1_15 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L80] COND TRUE (last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15) [L81] var_1_21 = (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L85] signed long int stepLocal_1 = ((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12; [L86] signed long int stepLocal_0 = last_1_var_1_21 + last_1_var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, stepLocal_1=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L87] COND FALSE !((last_1_var_1_21 * last_1_var_1_21) < stepLocal_1) [L92] var_1_8 = var_1_13 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L94] COND TRUE ! (var_1_21 > var_1_8) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L95] COND TRUE \read(var_1_4) [L96] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=65, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L99] COND FALSE !((8 / var_1_15) < (64 / var_1_16)) [L106] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L108] COND TRUE (- var_1_14) <= var_1_14 [L109] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L117] COND FALSE !(var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L189] RET step() [L190] CALL, EXPR property() [L180] EXPR ((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L180-L181] return (((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25)))) && ((! (var_1_21 > var_1_8)) ? (var_1_4 ? (var_1_25 == ((signed char) var_1_26)) : 1) : 1) ; [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=65, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 7, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1307 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1247 mSDsluCounter, 2568 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1807 mSDsCounter, 665 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1567 IncrementalHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 665 mSolverCounterUnsat, 761 mSDtfsCounter, 1567 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1429 GetRequests, 1371 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=501occurred in iteration=6, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 196 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2246 NumberOfCodeBlocks, 2246 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2029 ConstructedInterpolants, 0 QuantifiedInterpolants, 6669 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1379 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 20652/21120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 01:06:20,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.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 c09ae5383c303ea70fa8be3591cb19f07b66ade63b6f0323637dd7a8d6da530f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:06:22,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:06:22,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 01:06:22,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:06:22,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:06:22,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:06:22,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:06:22,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:06:22,425 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:06:22,425 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:06:22,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:06:22,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:06:22,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:06:22,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:06:22,430 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:06:22,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:06:22,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:06:22,431 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:06:22,431 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:06:22,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:06:22,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:06:22,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:06:22,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:06:22,436 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 01:06:22,436 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 01:06:22,437 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:06:22,437 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 01:06:22,437 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:06:22,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:06:22,437 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:06:22,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:06:22,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:06:22,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:06:22,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:06:22,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:06:22,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:06:22,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:06:22,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:06:22,439 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 01:06:22,439 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 01:06:22,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:06:22,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:06:22,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:06:22,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:06:22,444 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 01:06:22,444 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 -> c09ae5383c303ea70fa8be3591cb19f07b66ade63b6f0323637dd7a8d6da530f [2024-10-13 01:06:22,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:06:22,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:06:22,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:06:22,772 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:06:22,772 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:06:22,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i [2024-10-13 01:06:24,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:06:24,628 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:06:24,628 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i [2024-10-13 01:06:24,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9e4c8c8/ccd0c4c5c0824753910adf24f91123d9/FLAGdd9f20487 [2024-10-13 01:06:24,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9e4c8c8/ccd0c4c5c0824753910adf24f91123d9 [2024-10-13 01:06:24,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:06:24,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:06:24,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:06:24,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:06:24,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:06:24,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:06:24" (1/1) ... [2024-10-13 01:06:24,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df8db90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:24, skipping insertion in model container [2024-10-13 01:06:24,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:06:24" (1/1) ... [2024-10-13 01:06:24,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:06:24,832 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i[915,928] [2024-10-13 01:06:24,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:06:24,906 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:06:24,917 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i[915,928] [2024-10-13 01:06:24,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:06:24,969 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:06:24,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:24 WrapperNode [2024-10-13 01:06:24,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:06:24,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:06:24,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:06:24,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:06:24,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:24" (1/1) ... [2024-10-13 01:06:24,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:24" (1/1) ... [2024-10-13 01:06:25,016 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-10-13 01:06:25,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:06:25,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:06:25,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:06:25,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:06:25,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:24" (1/1) ... [2024-10-13 01:06:25,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:24" (1/1) ... [2024-10-13 01:06:25,040 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:24" (1/1) ... [2024-10-13 01:06:25,053 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 01:06:25,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:24" (1/1) ... [2024-10-13 01:06:25,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:24" (1/1) ... [2024-10-13 01:06:25,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:24" (1/1) ... [2024-10-13 01:06:25,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:24" (1/1) ... [2024-10-13 01:06:25,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:24" (1/1) ... [2024-10-13 01:06:25,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:24" (1/1) ... [2024-10-13 01:06:25,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:06:25,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:06:25,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:06:25,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:06:25,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:24" (1/1) ... [2024-10-13 01:06:25,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:06:25,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:06:25,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 01:06:25,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 01:06:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:06:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 01:06:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:06:25,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:06:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:06:25,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:06:25,228 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:06:25,230 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:06:30,509 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 01:06:30,509 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:06:30,571 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:06:30,573 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:06:30,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:06:30 BoogieIcfgContainer [2024-10-13 01:06:30,573 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:06:30,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:06:30,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:06:30,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:06:30,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:06:24" (1/3) ... [2024-10-13 01:06:30,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3747f011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:06:30, skipping insertion in model container [2024-10-13 01:06:30,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:24" (2/3) ... [2024-10-13 01:06:30,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3747f011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:06:30, skipping insertion in model container [2024-10-13 01:06:30,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:06:30" (3/3) ... [2024-10-13 01:06:30,580 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-38.i [2024-10-13 01:06:30,615 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:06:30,615 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:06:30,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:06:30,719 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;@1dd3821f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:06:30,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:06:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 48 states have internal predecessors, (69), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 01:06:30,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-13 01:06:30,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:30,756 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:30,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:30,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:30,770 INFO L85 PathProgramCache]: Analyzing trace with hash 407129373, now seen corresponding path program 1 times [2024-10-13 01:06:30,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:06:30,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972118718] [2024-10-13 01:06:30,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:30,782 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:06:30,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:06:30,786 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-10-13 01:06:30,808 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-10-13 01:06:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 01:06:31,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:06:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 1700 trivial. 0 not checked. [2024-10-13 01:06:31,302 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:06:31,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:06:31,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972118718] [2024-10-13 01:06:31,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972118718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:06:31,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:06:31,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:06:31,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878990341] [2024-10-13 01:06:31,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:06:31,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:06:31,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:06:31,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:06:31,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:06:31,346 INFO L87 Difference]: Start difference. First operand has 83 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 48 states have internal predecessors, (69), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 01:06:35,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:06:35,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:35,513 INFO L93 Difference]: Finished difference Result 163 states and 301 transitions. [2024-10-13 01:06:35,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:06:35,554 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 200 [2024-10-13 01:06:35,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:35,563 INFO L225 Difference]: With dead ends: 163 [2024-10-13 01:06:35,563 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 01:06:35,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:06:35,571 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:35,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-13 01:06:35,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 01:06:35,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-13 01:06:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 01:06:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 129 transitions. [2024-10-13 01:06:35,615 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 129 transitions. Word has length 200 [2024-10-13 01:06:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:35,615 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 129 transitions. [2024-10-13 01:06:35,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 01:06:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 129 transitions. [2024-10-13 01:06:35,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-13 01:06:35,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:35,636 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:35,656 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-10-13 01:06:35,836 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-10-13 01:06:35,837 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:35,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:35,837 INFO L85 PathProgramCache]: Analyzing trace with hash 578597733, now seen corresponding path program 1 times [2024-10-13 01:06:35,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:06:35,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776868098] [2024-10-13 01:06:35,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:35,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:06:35,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:06:35,841 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-10-13 01:06:35,842 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-10-13 01:06:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:36,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 01:06:36,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:06:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 01:06:38,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:06:38,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:06:38,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776868098] [2024-10-13 01:06:38,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776868098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:06:38,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:06:38,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:06:38,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791598124] [2024-10-13 01:06:38,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:06:38,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:06:38,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:06:38,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:06:38,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:06:38,103 INFO L87 Difference]: Start difference. First operand 81 states and 129 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 01:06:42,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:06:43,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:06:48,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:06:50,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:06:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:50,644 INFO L93 Difference]: Finished difference Result 381 states and 608 transitions. [2024-10-13 01:06:50,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 01:06:50,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 200 [2024-10-13 01:06:50,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:50,650 INFO L225 Difference]: With dead ends: 381 [2024-10-13 01:06:50,650 INFO L226 Difference]: Without dead ends: 301 [2024-10-13 01:06:50,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 01:06:50,652 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 218 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 67 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:50,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 716 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 12.4s Time] [2024-10-13 01:06:50,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-13 01:06:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 159. [2024-10-13 01:06:50,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 01:06:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 255 transitions. [2024-10-13 01:06:50,683 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 255 transitions. Word has length 200 [2024-10-13 01:06:50,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:50,684 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 255 transitions. [2024-10-13 01:06:50,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 01:06:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 255 transitions. [2024-10-13 01:06:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 01:06:50,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:50,687 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:50,705 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 (3)] Ended with exit code 0 [2024-10-13 01:06:50,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-10-13 01:06:50,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:50,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:50,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1663732996, now seen corresponding path program 1 times [2024-10-13 01:06:50,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:06:50,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569604499] [2024-10-13 01:06:50,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:50,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:06:50,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:06:50,895 INFO L229 MonitoredProcess]: Starting monitored process 4 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-10-13 01:06:50,896 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 (4)] Waiting until timeout for monitored process [2024-10-13 01:06:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:51,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 01:06:51,285 INFO L278 TraceCheckSpWp]: Computing forward predicates...