./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-67.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dc71e27d640f259fee6a990f264936ae2bb4c56d6f3df0625c1e5ccb12b32ff9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:26:10,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:26:10,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:26:10,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:26:10,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:26:10,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:26:10,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:26:10,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:26:10,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:26:10,850 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:26:10,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:26:10,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:26:10,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:26:10,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:26:10,854 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:26:10,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:26:10,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:26:10,855 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:26:10,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:26:10,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:26:10,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:26:10,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:26:10,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:26:10,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:26:10,857 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:26:10,857 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:26:10,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:26:10,858 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:26:10,858 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:26:10,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:26:10,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:26:10,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:26:10,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:26:10,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:26:10,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:26:10,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:26:10,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:26:10,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:26:10,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:26:10,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:26:10,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:26:10,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:26:10,863 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dc71e27d640f259fee6a990f264936ae2bb4c56d6f3df0625c1e5ccb12b32ff9 [2024-10-11 10:26:11,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:26:11,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:26:11,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:26:11,168 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:26:11,169 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:26:11,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-67.i [2024-10-11 10:26:12,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:26:12,894 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:26:12,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-67.i [2024-10-11 10:26:12,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/184dd1195/66651b2d138f48eba938e1552ff0b118/FLAG8b54b46ea [2024-10-11 10:26:13,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/184dd1195/66651b2d138f48eba938e1552ff0b118 [2024-10-11 10:26:13,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:26:13,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:26:13,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:26:13,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:26:13,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:26:13,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:26:13" (1/1) ... [2024-10-11 10:26:13,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502f4f81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:13, skipping insertion in model container [2024-10-11 10:26:13,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:26:13" (1/1) ... [2024-10-11 10:26:13,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:26:13,431 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-67.i[919,932] [2024-10-11 10:26:13,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:26:13,513 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:26:13,529 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-67.i[919,932] [2024-10-11 10:26:13,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:26:13,586 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:26:13,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:13 WrapperNode [2024-10-11 10:26:13,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:26:13,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:26:13,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:26:13,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:26:13,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:13" (1/1) ... [2024-10-11 10:26:13,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:13" (1/1) ... [2024-10-11 10:26:13,662 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 265 [2024-10-11 10:26:13,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:26:13,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:26:13,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:26:13,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:26:13,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:13" (1/1) ... [2024-10-11 10:26:13,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:13" (1/1) ... [2024-10-11 10:26:13,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:13" (1/1) ... [2024-10-11 10:26:13,696 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:26:13,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:13" (1/1) ... [2024-10-11 10:26:13,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:13" (1/1) ... [2024-10-11 10:26:13,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:13" (1/1) ... [2024-10-11 10:26:13,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:13" (1/1) ... [2024-10-11 10:26:13,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:13" (1/1) ... [2024-10-11 10:26:13,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:13" (1/1) ... [2024-10-11 10:26:13,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:26:13,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:26:13,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:26:13,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:26:13,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:13" (1/1) ... [2024-10-11 10:26:13,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:26:13,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:26:13,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:26:13,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:26:13,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:26:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:26:13,820 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:26:13,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:26:13,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:26:13,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:26:13,942 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:26:13,944 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:26:14,455 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-11 10:26:14,455 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:26:14,536 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:26:14,538 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:26:14,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:26:14 BoogieIcfgContainer [2024-10-11 10:26:14,539 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:26:14,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:26:14,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:26:14,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:26:14,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:26:13" (1/3) ... [2024-10-11 10:26:14,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df5d319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:26:14, skipping insertion in model container [2024-10-11 10:26:14,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:13" (2/3) ... [2024-10-11 10:26:14,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df5d319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:26:14, skipping insertion in model container [2024-10-11 10:26:14,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:26:14" (3/3) ... [2024-10-11 10:26:14,554 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-67.i [2024-10-11 10:26:14,571 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:26:14,572 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:26:14,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:26:14,664 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;@7604de8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:26:14,665 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:26:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 71 states have internal predecessors, (104), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 10:26:14,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-11 10:26:14,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:14,692 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:14,693 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:14,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:14,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2038382382, now seen corresponding path program 1 times [2024-10-11 10:26:14,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:26:14,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467911156] [2024-10-11 10:26:14,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:14,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:26:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:26:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:26:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:26:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:26:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:26:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:26:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:26:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:26:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:26:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:26:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:26:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:26:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:26:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:26:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:26:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:26:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:26:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:26:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:26:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:26:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:26:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:26:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:26:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:26:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:26:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:26:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:26:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:26:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:26:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 10:26:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 10:26:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:26:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 10:26:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:26:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:26:15,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:26:15,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467911156] [2024-10-11 10:26:15,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467911156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:26:15,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:26:15,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:26:15,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351417733] [2024-10-11 10:26:15,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:26:15,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:26:15,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:26:15,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:26:15,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:26:15,388 INFO L87 Difference]: Start difference. First operand has 107 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 71 states have internal predecessors, (104), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 10:26:15,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:26:15,453 INFO L93 Difference]: Finished difference Result 210 states and 374 transitions. [2024-10-11 10:26:15,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:26:15,457 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 211 [2024-10-11 10:26:15,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:26:15,466 INFO L225 Difference]: With dead ends: 210 [2024-10-11 10:26:15,466 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 10:26:15,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:26:15,480 INFO L432 NwaCegarLoop]: 161 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, 161 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:26:15,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:26:15,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 10:26:15,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 10:26:15,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 10:26:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 164 transitions. [2024-10-11 10:26:15,541 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 164 transitions. Word has length 211 [2024-10-11 10:26:15,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:26:15,542 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 164 transitions. [2024-10-11 10:26:15,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 10:26:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 164 transitions. [2024-10-11 10:26:15,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-11 10:26:15,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:15,547 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:15,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:26:15,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:15,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:15,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1337762046, now seen corresponding path program 1 times [2024-10-11 10:26:15,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:26:15,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302708261] [2024-10-11 10:26:15,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:15,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:26:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:26:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:26:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:26:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:26:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:15,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:26:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:26:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:26:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:26:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:26:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:26:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:26:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:26:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:26:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:26:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:26:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:26:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:26:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:26:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:26:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:26:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:26:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:26:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:26:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:26:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:26:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:26:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:26:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:26:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:26:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 10:26:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 10:26:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:26:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 10:26:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:26:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:26:16,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:26:16,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302708261] [2024-10-11 10:26:16,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302708261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:26:16,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:26:16,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:26:16,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766951321] [2024-10-11 10:26:16,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:26:16,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:26:16,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:26:16,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:26:16,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:26:16,153 INFO L87 Difference]: Start difference. First operand 104 states and 164 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:16,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:26:16,256 INFO L93 Difference]: Finished difference Result 310 states and 490 transitions. [2024-10-11 10:26:16,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:26:16,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 211 [2024-10-11 10:26:16,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:26:16,263 INFO L225 Difference]: With dead ends: 310 [2024-10-11 10:26:16,264 INFO L226 Difference]: Without dead ends: 207 [2024-10-11 10:26:16,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:26:16,266 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 94 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:26:16,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 299 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:26:16,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-11 10:26:16,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2024-10-11 10:26:16,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 134 states have (on average 1.4104477611940298) internal successors, (189), 134 states have internal predecessors, (189), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 10:26:16,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 325 transitions. [2024-10-11 10:26:16,319 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 325 transitions. Word has length 211 [2024-10-11 10:26:16,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:26:16,322 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 325 transitions. [2024-10-11 10:26:16,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:16,322 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 325 transitions. [2024-10-11 10:26:16,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-11 10:26:16,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:16,326 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:16,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:26:16,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:16,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:16,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2147108672, now seen corresponding path program 1 times [2024-10-11 10:26:16,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:26:16,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675793134] [2024-10-11 10:26:16,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:16,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:26:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:26:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:26:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:26:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:26:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:26:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:26:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:26:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:26:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:26:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:26:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:26:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:26:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:26:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:26:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:26:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:26:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:26:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:26:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:26:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:26:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:26:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:26:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:26:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:26:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:26:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:26:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:26:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:26:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:26:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 10:26:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 10:26:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:26:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 10:26:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:26:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:26:16,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:26:16,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675793134] [2024-10-11 10:26:16,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675793134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:26:16,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:26:16,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:26:16,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256521598] [2024-10-11 10:26:16,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:26:16,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:26:16,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:26:16,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:26:16,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:26:16,856 INFO L87 Difference]: Start difference. First operand 205 states and 325 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:26:16,985 INFO L93 Difference]: Finished difference Result 613 states and 973 transitions. [2024-10-11 10:26:16,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:26:16,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 211 [2024-10-11 10:26:16,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:26:16,990 INFO L225 Difference]: With dead ends: 613 [2024-10-11 10:26:16,990 INFO L226 Difference]: Without dead ends: 409 [2024-10-11 10:26:16,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:26:16,993 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 103 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:26:16,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 303 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:26:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-11 10:26:17,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 405. [2024-10-11 10:26:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 264 states have (on average 1.4015151515151516) internal successors, (370), 264 states have internal predecessors, (370), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-11 10:26:17,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 642 transitions. [2024-10-11 10:26:17,093 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 642 transitions. Word has length 211 [2024-10-11 10:26:17,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:26:17,094 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 642 transitions. [2024-10-11 10:26:17,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 642 transitions. [2024-10-11 10:26:17,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-11 10:26:17,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:17,098 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:17,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:26:17,101 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:17,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:17,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1929491792, now seen corresponding path program 1 times [2024-10-11 10:26:17,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:26:17,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200977990] [2024-10-11 10:26:17,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:17,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:26:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:26:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:26:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:26:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:26:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:26:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:26:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:26:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:26:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:26:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:26:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:26:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:26:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:26:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:26:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:26:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:26:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:26:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:26:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:26:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:26:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:26:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:26:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:26:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:26:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:26:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:26:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:26:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:26:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:26:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 10:26:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 10:26:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:26:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 10:26:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:26:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:26:17,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:26:17,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200977990] [2024-10-11 10:26:17,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200977990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:26:17,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:26:17,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:26:17,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690120848] [2024-10-11 10:26:17,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:26:17,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:26:17,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:26:17,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:26:17,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:26:17,547 INFO L87 Difference]: Start difference. First operand 405 states and 642 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:17,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:26:17,669 INFO L93 Difference]: Finished difference Result 813 states and 1288 transitions. [2024-10-11 10:26:17,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:26:17,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 212 [2024-10-11 10:26:17,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:26:17,678 INFO L225 Difference]: With dead ends: 813 [2024-10-11 10:26:17,679 INFO L226 Difference]: Without dead ends: 409 [2024-10-11 10:26:17,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:26:17,682 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 101 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:26:17,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 304 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:26:17,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-11 10:26:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 405. [2024-10-11 10:26:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 264 states have (on average 1.393939393939394) internal successors, (368), 264 states have internal predecessors, (368), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-11 10:26:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 640 transitions. [2024-10-11 10:26:17,737 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 640 transitions. Word has length 212 [2024-10-11 10:26:17,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:26:17,738 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 640 transitions. [2024-10-11 10:26:17,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:17,741 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 640 transitions. [2024-10-11 10:26:17,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-11 10:26:17,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:17,744 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:17,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:26:17,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:17,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:17,745 INFO L85 PathProgramCache]: Analyzing trace with hash 676531762, now seen corresponding path program 1 times [2024-10-11 10:26:17,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:26:17,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563871819] [2024-10-11 10:26:17,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:17,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:26:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:26:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:26:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:26:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:26:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:26:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:26:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:26:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:26:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:26:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:26:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:26:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:26:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:26:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:26:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:26:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:26:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:26:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:26:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:26:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:17,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:26:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:26:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:26:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:26:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:26:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:26:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:26:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:26:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:26:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:26:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 10:26:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 10:26:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:26:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 10:26:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:26:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:26:18,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:26:18,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563871819] [2024-10-11 10:26:18,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563871819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:26:18,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:26:18,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:26:18,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325208951] [2024-10-11 10:26:18,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:26:18,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:26:18,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:26:18,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:26:18,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:26:18,066 INFO L87 Difference]: Start difference. First operand 405 states and 640 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:18,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:26:18,134 INFO L93 Difference]: Finished difference Result 904 states and 1430 transitions. [2024-10-11 10:26:18,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:26:18,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 212 [2024-10-11 10:26:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:26:18,140 INFO L225 Difference]: With dead ends: 904 [2024-10-11 10:26:18,140 INFO L226 Difference]: Without dead ends: 500 [2024-10-11 10:26:18,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:26:18,144 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 77 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:26:18,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 313 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:26:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-10-11 10:26:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 475. [2024-10-11 10:26:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 299 states have (on average 1.3612040133779264) internal successors, (407), 299 states have internal predecessors, (407), 170 states have call successors, (170), 5 states have call predecessors, (170), 5 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2024-10-11 10:26:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 747 transitions. [2024-10-11 10:26:18,211 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 747 transitions. Word has length 212 [2024-10-11 10:26:18,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:26:18,212 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 747 transitions. [2024-10-11 10:26:18,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:18,212 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 747 transitions. [2024-10-11 10:26:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 10:26:18,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:18,215 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:18,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:26:18,216 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:18,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:18,216 INFO L85 PathProgramCache]: Analyzing trace with hash 655229330, now seen corresponding path program 1 times [2024-10-11 10:26:18,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:26:18,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834052297] [2024-10-11 10:26:18,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:18,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:26:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:26:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:26:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:26:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:26:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:26:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:26:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:26:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:26:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:26:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:26:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:26:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:26:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:26:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:26:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:26:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:26:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:26:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:26:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:26:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:26:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:26:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:26:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:26:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:26:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:26:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:26:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:26:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:26:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:26:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 10:26:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 10:26:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:26:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 10:26:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:26:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:26:18,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:26:18,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834052297] [2024-10-11 10:26:18,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834052297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:26:18,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:26:18,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:26:18,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520373782] [2024-10-11 10:26:18,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:26:18,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:26:18,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:26:18,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:26:18,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:26:18,489 INFO L87 Difference]: Start difference. First operand 475 states and 747 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:18,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:26:18,887 INFO L93 Difference]: Finished difference Result 1560 states and 2460 transitions. [2024-10-11 10:26:18,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:26:18,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-10-11 10:26:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:26:18,898 INFO L225 Difference]: With dead ends: 1560 [2024-10-11 10:26:18,899 INFO L226 Difference]: Without dead ends: 1151 [2024-10-11 10:26:18,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:26:18,903 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 291 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:26:18,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 369 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:26:18,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-10-11 10:26:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1071. [2024-10-11 10:26:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 685 states have (on average 1.3708029197080291) internal successors, (939), 685 states have internal predecessors, (939), 374 states have call successors, (374), 11 states have call predecessors, (374), 11 states have return successors, (374), 374 states have call predecessors, (374), 374 states have call successors, (374) [2024-10-11 10:26:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1687 transitions. [2024-10-11 10:26:19,030 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1687 transitions. Word has length 215 [2024-10-11 10:26:19,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:26:19,031 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1687 transitions. [2024-10-11 10:26:19,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1687 transitions. [2024-10-11 10:26:19,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 10:26:19,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:19,034 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:19,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 10:26:19,034 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:19,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:19,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1690247355, now seen corresponding path program 1 times [2024-10-11 10:26:19,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:26:19,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062764236] [2024-10-11 10:26:19,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:19,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:26:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:26:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:26:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:26:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:26:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:26:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:26:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:26:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:26:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:26:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:26:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:26:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:26:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:26:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:26:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:26:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:26:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:26:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:26:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:26:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:26:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:26:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:26:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:26:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:26:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:26:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:26:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:26:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:26:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:26:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 10:26:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 10:26:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:26:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 10:26:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:26:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:19,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:26:19,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:26:19,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062764236] [2024-10-11 10:26:19,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062764236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:26:19,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:26:19,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:26:19,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134524462] [2024-10-11 10:26:19,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:26:19,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:26:19,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:26:19,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:26:19,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:26:19,302 INFO L87 Difference]: Start difference. First operand 1071 states and 1687 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:19,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:26:19,870 INFO L93 Difference]: Finished difference Result 2509 states and 3945 transitions. [2024-10-11 10:26:19,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:26:19,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2024-10-11 10:26:19,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:26:19,883 INFO L225 Difference]: With dead ends: 2509 [2024-10-11 10:26:19,883 INFO L226 Difference]: Without dead ends: 1504 [2024-10-11 10:26:19,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:26:19,890 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 230 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 10:26:19,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 375 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 10:26:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2024-10-11 10:26:20,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1423. [2024-10-11 10:26:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 897 states have (on average 1.351170568561873) internal successors, (1212), 897 states have internal predecessors, (1212), 510 states have call successors, (510), 15 states have call predecessors, (510), 15 states have return successors, (510), 510 states have call predecessors, (510), 510 states have call successors, (510) [2024-10-11 10:26:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 2232 transitions. [2024-10-11 10:26:20,060 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 2232 transitions. Word has length 216 [2024-10-11 10:26:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:26:20,061 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 2232 transitions. [2024-10-11 10:26:20,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2232 transitions. [2024-10-11 10:26:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 10:26:20,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:20,065 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:20,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 10:26:20,066 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:20,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:20,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1682914063, now seen corresponding path program 1 times [2024-10-11 10:26:20,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:26:20,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215547851] [2024-10-11 10:26:20,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:20,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:26:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:26:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:26:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:26:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:26:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:26:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:26:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:26:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:26:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:26:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:26:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:26:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:26:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:26:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:26:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:26:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:26:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:26:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:26:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:26:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:26:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:26:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:26:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:26:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:26:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:26:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:26:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:26:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:26:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:26:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 10:26:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 10:26:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:26:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 10:26:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:26:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:26:20,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:26:20,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215547851] [2024-10-11 10:26:20,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215547851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:26:20,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:26:20,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:26:20,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711246012] [2024-10-11 10:26:20,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:26:20,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:26:20,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:26:20,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:26:20,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:26:20,389 INFO L87 Difference]: Start difference. First operand 1423 states and 2232 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:26:20,704 INFO L93 Difference]: Finished difference Result 2936 states and 4598 transitions. [2024-10-11 10:26:20,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:26:20,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2024-10-11 10:26:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:26:20,718 INFO L225 Difference]: With dead ends: 2936 [2024-10-11 10:26:20,718 INFO L226 Difference]: Without dead ends: 1584 [2024-10-11 10:26:20,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:26:20,725 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 111 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:26:20,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 462 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:26:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2024-10-11 10:26:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1444. [2024-10-11 10:26:20,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 918 states have (on average 1.3529411764705883) internal successors, (1242), 918 states have internal predecessors, (1242), 510 states have call successors, (510), 15 states have call predecessors, (510), 15 states have return successors, (510), 510 states have call predecessors, (510), 510 states have call successors, (510) [2024-10-11 10:26:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2262 transitions. [2024-10-11 10:26:20,913 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2262 transitions. Word has length 217 [2024-10-11 10:26:20,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:26:20,913 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 2262 transitions. [2024-10-11 10:26:20,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2262 transitions. [2024-10-11 10:26:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 10:26:20,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:20,916 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:20,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 10:26:20,916 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:20,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:20,917 INFO L85 PathProgramCache]: Analyzing trace with hash -402098203, now seen corresponding path program 1 times [2024-10-11 10:26:20,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:26:20,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102223911] [2024-10-11 10:26:20,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:20,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:26:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:26:21,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [765883065] [2024-10-11 10:26:21,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:21,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:26:21,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:26:21,069 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:26:21,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:26:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:26:21,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:26:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:26:21,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:26:21,481 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:26:21,482 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:26:21,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 10:26:21,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:26:21,689 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:21,856 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:26:21,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:26:21 BoogieIcfgContainer [2024-10-11 10:26:21,860 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:26:21,861 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:26:21,861 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:26:21,861 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:26:21,861 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:26:14" (3/4) ... [2024-10-11 10:26:21,864 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:26:21,865 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:26:21,865 INFO L158 Benchmark]: Toolchain (without parser) took 8633.19ms. Allocated memory was 174.1MB in the beginning and 308.3MB in the end (delta: 134.2MB). Free memory was 143.0MB in the beginning and 236.2MB in the end (delta: -93.2MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2024-10-11 10:26:21,866 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory was 86.0MB in the beginning and 85.9MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:26:21,866 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.07ms. Allocated memory is still 174.1MB. Free memory was 143.0MB in the beginning and 125.9MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 10:26:21,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.16ms. Allocated memory is still 174.1MB. Free memory was 125.9MB in the beginning and 121.0MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 10:26:21,866 INFO L158 Benchmark]: Boogie Preprocessor took 63.52ms. Allocated memory is still 174.1MB. Free memory was 121.0MB in the beginning and 115.4MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:26:21,866 INFO L158 Benchmark]: RCFGBuilder took 811.57ms. Allocated memory is still 174.1MB. Free memory was 115.4MB in the beginning and 136.4MB in the end (delta: -21.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-11 10:26:21,867 INFO L158 Benchmark]: TraceAbstraction took 7315.35ms. Allocated memory was 174.1MB in the beginning and 308.3MB in the end (delta: 134.2MB). Free memory was 136.4MB in the beginning and 236.2MB in the end (delta: -99.8MB). Peak memory consumption was 184.6MB. Max. memory is 16.1GB. [2024-10-11 10:26:21,867 INFO L158 Benchmark]: Witness Printer took 4.33ms. Allocated memory is still 308.3MB. Free memory is still 236.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:26:21,868 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory was 86.0MB in the beginning and 85.9MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.07ms. Allocated memory is still 174.1MB. Free memory was 143.0MB in the beginning and 125.9MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.16ms. Allocated memory is still 174.1MB. Free memory was 125.9MB in the beginning and 121.0MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.52ms. Allocated memory is still 174.1MB. Free memory was 121.0MB in the beginning and 115.4MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 811.57ms. Allocated memory is still 174.1MB. Free memory was 115.4MB in the beginning and 136.4MB in the end (delta: -21.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7315.35ms. Allocated memory was 174.1MB in the beginning and 308.3MB in the end (delta: 134.2MB). Free memory was 136.4MB in the beginning and 236.2MB in the end (delta: -99.8MB). Peak memory consumption was 184.6MB. Max. memory is 16.1GB. * Witness Printer took 4.33ms. Allocated memory is still 308.3MB. Free memory is still 236.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 213, overapproximation of bitwiseAnd at line 73, overapproximation of someBinaryArithmeticDOUBLEoperation at line 134, overapproximation of someBinaryDOUBLEComparisonOperation at line 213, overapproximation of someUnaryFLOAToperation at line 137. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9.75; [L23] unsigned char var_1_3 = 1; [L24] signed long int var_1_4 = 25; [L25] unsigned char var_1_6 = 1; [L26] float var_1_7 = 7.5; [L27] signed long int var_1_8 = -1000; [L28] float var_1_9 = 9.25; [L29] float var_1_10 = 64.5; [L30] float var_1_11 = 16.25; [L31] signed char var_1_12 = 2; [L32] signed char var_1_13 = 8; [L33] signed char var_1_14 = 0; [L34] float var_1_15 = 0.6; [L35] signed char var_1_16 = 32; [L36] unsigned short int var_1_17 = 2; [L37] unsigned short int var_1_19 = 63241; [L38] unsigned short int var_1_20 = 58697; [L39] unsigned short int var_1_21 = 25516; [L40] unsigned long int var_1_22 = 3301682525; [L41] double var_1_23 = 128.9; [L42] double var_1_27 = 7.75; [L43] double var_1_28 = 200.6; [L44] unsigned long int var_1_29 = 100000; [L45] unsigned long int var_1_31 = 4154314939; [L46] unsigned char var_1_33 = 0; [L47] unsigned char var_1_34 = 0; [L48] float var_1_35 = 49.875; [L49] signed short int var_1_36 = -32; [L50] unsigned long int var_1_38 = 128; [L51] double var_1_39 = 50.925; [L52] double var_1_40 = 128.6; [L53] unsigned long int var_1_42 = 4282912011; [L54] signed long int var_1_44 = 5; [L55] signed short int var_1_45 = 500; [L56] double last_1_var_1_1 = 9.75; [L57] unsigned char last_1_var_1_3 = 1; [L58] float last_1_var_1_7 = 7.5; [L59] signed char last_1_var_1_12 = 2; [L60] float last_1_var_1_15 = 0.6; [L61] unsigned short int last_1_var_1_17 = 2; [L217] isInitial = 1 [L218] FCALL initially() [L219] COND TRUE 1 [L220] CALL updateLastVariables() [L205] last_1_var_1_1 = var_1_1 [L206] last_1_var_1_3 = var_1_3 [L207] last_1_var_1_7 = var_1_7 [L208] last_1_var_1_12 = var_1_12 [L209] last_1_var_1_15 = var_1_15 [L210] last_1_var_1_17 = var_1_17 [L220] RET updateLastVariables() [L221] CALL updateVariables() [L149] var_1_4 = __VERIFIER_nondet_long() [L150] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L150] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L151] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L151] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L152] var_1_6 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L153] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L154] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L154] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L155] var_1_8 = __VERIFIER_nondet_long() [L156] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, var_1_9=37/4] [L156] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, var_1_9=37/4] [L157] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, var_1_9=37/4] [L157] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, var_1_9=37/4] [L158] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, var_1_9=37/4] [L158] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, var_1_9=37/4] [L159] var_1_9 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L160] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L161] var_1_10 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L162] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L163] var_1_11 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L164] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L165] var_1_13 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L166] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L167] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L167] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L168] var_1_14 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L169] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L170] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L170] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L171] var_1_19 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_19 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L172] RET assume_abort_if_not(var_1_19 >= 32767) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L173] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L173] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L174] var_1_20 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_20 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L175] RET assume_abort_if_not(var_1_20 >= 32767) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L176] CALL assume_abort_if_not(var_1_20 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L176] RET assume_abort_if_not(var_1_20 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L177] var_1_21 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_21 >= 24575) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L178] RET assume_abort_if_not(var_1_21 >= 24575) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L179] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L179] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=3301682525, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L180] var_1_22 = __VERIFIER_nondet_ulong() [L181] CALL assume_abort_if_not(var_1_22 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L181] RET assume_abort_if_not(var_1_22 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L182] CALL assume_abort_if_not(var_1_22 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L182] RET assume_abort_if_not(var_1_22 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_27=31/4, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L183] var_1_27 = __VERIFIER_nondet_double() [L184] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L184] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=1003/5, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L185] var_1_28 = __VERIFIER_nondet_double() [L186] CALL assume_abort_if_not((var_1_28 >= -922337.2036854765600e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L186] RET assume_abort_if_not((var_1_28 >= -922337.2036854765600e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=4154314939, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L187] var_1_31 = __VERIFIER_nondet_ulong() [L188] CALL assume_abort_if_not(var_1_31 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L188] RET assume_abort_if_not(var_1_31 >= 3221225470) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L189] CALL assume_abort_if_not(var_1_31 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L189] RET assume_abort_if_not(var_1_31 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L190] var_1_34 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L191] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L192] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L192] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_39=2037/40, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L193] var_1_39 = __VERIFIER_nondet_double() [L194] CALL assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L194] RET assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_40=643/5, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L195] var_1_40 = __VERIFIER_nondet_double() [L196] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L196] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=4282912011, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L197] var_1_42 = __VERIFIER_nondet_ulong() [L198] CALL assume_abort_if_not(var_1_42 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L198] RET assume_abort_if_not(var_1_42 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L199] CALL assume_abort_if_not(var_1_42 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L199] RET assume_abort_if_not(var_1_42 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=500, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L200] var_1_45 = __VERIFIER_nondet_short() [L201] CALL assume_abort_if_not(var_1_45 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L201] RET assume_abort_if_not(var_1_45 >= -1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L202] CALL assume_abort_if_not(var_1_45 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L202] RET assume_abort_if_not(var_1_45 <= 32767) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L221] RET updateVariables() [L222] CALL step() [L65] COND TRUE var_1_12 < (var_1_17 + var_1_12) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L66] COND FALSE !(5 <= var_1_17) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L72] COND TRUE \read(var_1_3) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L73] EXPR (-10 + var_1_16) & var_1_17 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=100000, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L73] COND TRUE ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) > ((-10 + var_1_16) & var_1_17) [L74] var_1_29 = (((((var_1_31 - 64u) < 0 ) ? -(var_1_31 - 64u) : (var_1_31 - 64u))) - var_1_17) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_29=-1073741892, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=399/8, var_1_36=-32, var_1_38=128, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L79] var_1_33 = var_1_34 [L80] var_1_35 = var_1_28 [L81] var_1_36 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=2, var_1_29=-1073741892, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=2, var_1_36=32, var_1_38=128, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L82] COND FALSE !(var_1_1 > (var_1_39 - var_1_40)) [L91] var_1_38 = (((((var_1_31) > (var_1_42)) ? (var_1_31) : (var_1_42))) - ((((1795211791u - var_1_17) < 0 ) ? -(1795211791u - var_1_17) : (1795211791u - var_1_17)))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=2, var_1_29=-1073741892, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=2, var_1_36=32, var_1_38=1426013681, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L93] COND TRUE var_1_3 || var_1_3 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=2, var_1_29=-1073741892, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=2, var_1_36=32, var_1_38=1426013681, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L94] COND FALSE !(var_1_12 <= (var_1_45 - 64)) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=2, var_1_29=-1073741892, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=2, var_1_36=32, var_1_38=1426013681, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L104] EXPR ((((var_1_13) > (last_1_var_1_17)) ? (var_1_13) : (last_1_var_1_17))) | last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=2, var_1_29=-1073741892, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=2, var_1_36=32, var_1_38=1426013681, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L104] signed long int stepLocal_2 = ((((var_1_13) > (last_1_var_1_17)) ? (var_1_13) : (last_1_var_1_17))) | last_1_var_1_12; [L105] COND FALSE !(last_1_var_1_7 > (var_1_11 + last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=2, var_1_29=-1073741892, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=2, var_1_36=32, var_1_38=1426013681, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L114] unsigned long int stepLocal_3 = var_1_22 - var_1_20; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, stepLocal_3=-2147516416, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=2, var_1_29=-1073741892, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=2, var_1_36=32, var_1_38=1426013681, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L115] COND TRUE \read(last_1_var_1_3) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, stepLocal_3=-2147516416, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=2, var_1_29=-1073741892, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=2, var_1_36=32, var_1_38=1426013681, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L116] COND TRUE \read(var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, stepLocal_3=-2147516416, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=2, var_1_29=-1073741892, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=2, var_1_36=32, var_1_38=1426013681, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L117] COND TRUE \read(last_1_var_1_3) [L118] var_1_17 = var_1_14 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, stepLocal_3=-2147516416, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=2, var_1_29=-1073741892, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=2, var_1_36=32, var_1_38=1426013681, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L132] var_1_3 = (((5 - last_1_var_1_17) <= (last_1_var_1_17 + last_1_var_1_17)) || var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, stepLocal_3=-2147516416, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=2, var_1_29=-1073741892, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=2, var_1_36=32, var_1_38=1426013681, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L133] COND TRUE 50 != var_1_16 [L134] var_1_1 = (1.00000000000025E12 - 24.25) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, stepLocal_3=-2147516416, var_1_12=2, var_1_13=2, var_1_14=1, var_1_15=3/5, var_1_16=32, var_1_17=1, var_1_19=32768, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=2, var_1_29=-1073741892, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=2, var_1_36=32, var_1_38=1426013681, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133] [L136] var_1_12 = (var_1_13 - var_1_14) [L137] var_1_15 = ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) [L138] unsigned char stepLocal_1 = var_1_3; [L139] signed long int stepLocal_0 = (var_1_16 + 100) / var_1_8; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_0=0, stepLocal_1=1, stepLocal_2=2, stepLocal_3=-2147516416, var_1_12=1, var_1_13=2, var_1_14=1, var_1_15=3, var_1_16=32, var_1_17=1, var_1_19=32768, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=2, var_1_29=-1073741892, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=2, var_1_36=32, var_1_38=1426013681, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, var_1_9=0] [L140] COND FALSE !(stepLocal_0 >= var_1_17) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_1=1, stepLocal_2=2, stepLocal_3=-2147516416, var_1_12=1, var_1_13=2, var_1_14=1, var_1_15=3, var_1_16=32, var_1_17=1, var_1_19=32768, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=2, var_1_29=-1073741892, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=2, var_1_36=32, var_1_38=1426013681, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, var_1_9=0] [L222] RET step() [L223] CALL, EXPR property() [L213] EXPR ((((((50 != var_1_16) ? (var_1_1 == ((double) (1.00000000000025E12 - 24.25))) : 1) && (var_1_3 == ((unsigned char) (((5 - last_1_var_1_17) <= (last_1_var_1_17 + last_1_var_1_17)) || var_1_6)))) && ((((var_1_16 + 100) / var_1_8) >= var_1_17) ? ((var_1_3 || (var_1_17 > (var_1_17 * var_1_8))) ? (var_1_7 == ((float) var_1_9)) : (var_1_7 == ((float) (var_1_10 + var_1_11)))) : 1)) && (var_1_12 == ((signed char) (var_1_13 - var_1_14)))) && (var_1_15 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && ((last_1_var_1_7 > (var_1_11 + last_1_var_1_15)) ? ((var_1_14 < (((((var_1_13) > (last_1_var_1_17)) ? (var_1_13) : (last_1_var_1_17))) | last_1_var_1_12)) ? (last_1_var_1_3 ? (var_1_16 == ((signed char) -2)) : 1) : (var_1_16 == ((signed char) var_1_13))) : 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=1, var_1_13=2, var_1_14=1, var_1_15=3, var_1_16=32, var_1_17=1, var_1_19=32768, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=2, var_1_29=-1073741892, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=2, var_1_36=32, var_1_38=1426013681, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, var_1_9=0] [L213-L214] return (((((((50 != var_1_16) ? (var_1_1 == ((double) (1.00000000000025E12 - 24.25))) : 1) && (var_1_3 == ((unsigned char) (((5 - last_1_var_1_17) <= (last_1_var_1_17 + last_1_var_1_17)) || var_1_6)))) && ((((var_1_16 + 100) / var_1_8) >= var_1_17) ? ((var_1_3 || (var_1_17 > (var_1_17 * var_1_8))) ? (var_1_7 == ((float) var_1_9)) : (var_1_7 == ((float) (var_1_10 + var_1_11)))) : 1)) && (var_1_12 == ((signed char) (var_1_13 - var_1_14)))) && (var_1_15 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && ((last_1_var_1_7 > (var_1_11 + last_1_var_1_15)) ? ((var_1_14 < (((((var_1_13) > (last_1_var_1_17)) ? (var_1_13) : (last_1_var_1_17))) | last_1_var_1_12)) ? (last_1_var_1_3 ? (var_1_16 == ((signed char) -2)) : 1) : (var_1_16 == ((signed char) var_1_13))) : 1)) && (last_1_var_1_3 ? (var_1_6 ? (last_1_var_1_3 ? (var_1_17 == ((unsigned short int) var_1_14)) : (var_1_17 == ((unsigned short int) (((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))) - ((var_1_21 - 256) - 256))))) : (((var_1_22 - var_1_20) > (var_1_4 / var_1_8)) ? ((last_1_var_1_1 >= var_1_10) ? (var_1_17 == ((unsigned short int) var_1_14)) : 1) : 1)) : (var_1_17 == ((unsigned short int) var_1_21))) ; [L223] RET, EXPR property() [L223] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=1, var_1_13=2, var_1_14=1, var_1_15=3, var_1_16=32, var_1_17=1, var_1_19=32768, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=2, var_1_29=-1073741892, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=2, var_1_36=32, var_1_38=1426013681, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=1, var_1_13=2, var_1_14=1, var_1_15=3, var_1_16=32, var_1_17=1, var_1_19=32768, var_1_20=32767, var_1_21=-40961, var_1_22=-2147483649, var_1_23=1289/10, var_1_28=2, var_1_29=-1073741892, var_1_31=-1073741826, var_1_33=0, var_1_34=0, var_1_35=2, var_1_36=32, var_1_38=1426013681, var_1_3=1, var_1_42=3221225470, var_1_44=5, var_1_45=-1, var_1_4=1, var_1_6=1, var_1_7=15/2, var_1_8=133, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 9, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1007 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1007 mSDsluCounter, 2586 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1310 mSDsCounter, 252 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 458 IncrementalHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 252 mSolverCounterUnsat, 1276 mSDtfsCounter, 458 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 606 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1444occurred in iteration=8, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 8 MinimizatonAttempts, 336 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2143 NumberOfCodeBlocks, 2143 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1697 ConstructedInterpolants, 0 QuantifiedInterpolants, 3285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 17952/17952 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 10:26:21,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-67.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dc71e27d640f259fee6a990f264936ae2bb4c56d6f3df0625c1e5ccb12b32ff9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:26:24,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:26:24,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:26:24,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:26:24,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:26:24,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:26:24,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:26:24,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:26:24,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:26:24,413 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:26:24,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:26:24,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:26:24,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:26:24,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:26:24,418 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:26:24,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:26:24,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:26:24,419 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:26:24,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:26:24,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:26:24,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:26:24,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:26:24,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:26:24,420 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:26:24,421 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:26:24,421 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:26:24,421 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:26:24,421 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:26:24,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:26:24,422 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:26:24,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:26:24,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:26:24,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:26:24,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:26:24,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:26:24,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:26:24,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:26:24,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:26:24,425 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:26:24,426 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:26:24,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:26:24,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:26:24,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:26:24,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:26:24,427 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:26:24,427 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dc71e27d640f259fee6a990f264936ae2bb4c56d6f3df0625c1e5ccb12b32ff9 [2024-10-11 10:26:24,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:26:24,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:26:24,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:26:24,769 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:26:24,770 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:26:24,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-67.i [2024-10-11 10:26:26,353 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:26:26,585 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:26:26,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-67.i [2024-10-11 10:26:26,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/66523e208/0af1c2915177494ea99efb3032a5742e/FLAG8991aaf95 [2024-10-11 10:26:26,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/66523e208/0af1c2915177494ea99efb3032a5742e [2024-10-11 10:26:26,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:26:26,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:26:26,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:26:26,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:26:26,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:26:26,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:26:26" (1/1) ... [2024-10-11 10:26:26,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390d0ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:26, skipping insertion in model container [2024-10-11 10:26:26,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:26:26" (1/1) ... [2024-10-11 10:26:26,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:26:26,894 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-67.i[919,932] [2024-10-11 10:26:26,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:26:27,008 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:26:27,022 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-67.i[919,932] [2024-10-11 10:26:27,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:26:27,078 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:26:27,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:27 WrapperNode [2024-10-11 10:26:27,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:26:27,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:26:27,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:26:27,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:26:27,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:27" (1/1) ... [2024-10-11 10:26:27,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:27" (1/1) ... [2024-10-11 10:26:27,166 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2024-10-11 10:26:27,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:26:27,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:26:27,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:26:27,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:26:27,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:27" (1/1) ... [2024-10-11 10:26:27,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:27" (1/1) ... [2024-10-11 10:26:27,188 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:27" (1/1) ... [2024-10-11 10:26:27,211 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:26:27,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:27" (1/1) ... [2024-10-11 10:26:27,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:27" (1/1) ... [2024-10-11 10:26:27,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:27" (1/1) ... [2024-10-11 10:26:27,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:27" (1/1) ... [2024-10-11 10:26:27,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:27" (1/1) ... [2024-10-11 10:26:27,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:27" (1/1) ... [2024-10-11 10:26:27,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:26:27,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:26:27,262 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:26:27,262 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:26:27,263 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:27" (1/1) ... [2024-10-11 10:26:27,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:26:27,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:26:27,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:26:27,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:26:27,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:26:27,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:26:27,349 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:26:27,349 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:26:27,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:26:27,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:26:27,468 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:26:27,471 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:26:29,453 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 10:26:29,453 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:26:29,523 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:26:29,524 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:26:29,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:26:29 BoogieIcfgContainer [2024-10-11 10:26:29,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:26:29,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:26:29,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:26:29,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:26:29,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:26:26" (1/3) ... [2024-10-11 10:26:29,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad955fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:26:29, skipping insertion in model container [2024-10-11 10:26:29,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:26:27" (2/3) ... [2024-10-11 10:26:29,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad955fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:26:29, skipping insertion in model container [2024-10-11 10:26:29,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:26:29" (3/3) ... [2024-10-11 10:26:29,556 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-67.i [2024-10-11 10:26:29,574 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:26:29,575 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:26:29,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:26:29,660 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;@1d16da85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:26:29,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:26:29,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 10:26:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 10:26:29,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:29,689 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:29,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:29,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:29,698 INFO L85 PathProgramCache]: Analyzing trace with hash -632265613, now seen corresponding path program 1 times [2024-10-11 10:26:29,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:26:29,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917243789] [2024-10-11 10:26:29,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:29,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:29,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:26:29,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:26:29,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 10:26:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:30,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:26:30,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:26:30,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2024-10-11 10:26:30,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:26:30,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:26:30,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917243789] [2024-10-11 10:26:30,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917243789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:26:30,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:26:30,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:26:30,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617676583] [2024-10-11 10:26:30,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:26:30,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:26:30,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:26:30,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:26:30,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:26:30,436 INFO L87 Difference]: Start difference. First operand has 93 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 10:26:31,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:26:31,115 INFO L93 Difference]: Finished difference Result 182 states and 330 transitions. [2024-10-11 10:26:31,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:26:31,139 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 208 [2024-10-11 10:26:31,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:26:31,146 INFO L225 Difference]: With dead ends: 182 [2024-10-11 10:26:31,147 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 10:26:31,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:26:31,155 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 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.6s IncrementalHoareTripleChecker+Time [2024-10-11 10:26:31,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 10:26:31,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 10:26:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 10:26:31,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 10:26:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 142 transitions. [2024-10-11 10:26:31,219 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 142 transitions. Word has length 208 [2024-10-11 10:26:31,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:26:31,219 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 142 transitions. [2024-10-11 10:26:31,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 10:26:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 142 transitions. [2024-10-11 10:26:31,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 10:26:31,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:31,230 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:31,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 10:26:31,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:31,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:31,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:31,432 INFO L85 PathProgramCache]: Analyzing trace with hash 802346147, now seen corresponding path program 1 times [2024-10-11 10:26:31,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:26:31,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836051513] [2024-10-11 10:26:31,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:31,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:31,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:26:31,435 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:26:31,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 10:26:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:31,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 10:26:31,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:26:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:26:34,415 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:26:34,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:26:34,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836051513] [2024-10-11 10:26:34,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836051513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:26:34,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:26:34,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:26:34,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394322320] [2024-10-11 10:26:34,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:26:34,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:26:34,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:26:34,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:26:34,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:26:34,421 INFO L87 Difference]: Start difference. First operand 90 states and 142 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:36,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:26:36,206 INFO L93 Difference]: Finished difference Result 261 states and 415 transitions. [2024-10-11 10:26:36,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:26:36,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 208 [2024-10-11 10:26:36,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:26:36,211 INFO L225 Difference]: With dead ends: 261 [2024-10-11 10:26:36,211 INFO L226 Difference]: Without dead ends: 172 [2024-10-11 10:26:36,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:26:36,214 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 33 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 10:26:36,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 249 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 10:26:36,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-11 10:26:36,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 151. [2024-10-11 10:26:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 10:26:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 236 transitions. [2024-10-11 10:26:36,266 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 236 transitions. Word has length 208 [2024-10-11 10:26:36,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:26:36,268 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 236 transitions. [2024-10-11 10:26:36,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 236 transitions. [2024-10-11 10:26:36,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-11 10:26:36,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:36,277 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:36,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 10:26:36,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:36,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:36,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:36,480 INFO L85 PathProgramCache]: Analyzing trace with hash -298765247, now seen corresponding path program 1 times [2024-10-11 10:26:36,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:26:36,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021852030] [2024-10-11 10:26:36,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:36,483 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:36,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:26:36,486 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:26:36,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 10:26:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:36,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 10:26:36,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:26:37,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:26:37,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:26:37,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:26:37,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021852030] [2024-10-11 10:26:37,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021852030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:26:37,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:26:37,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:26:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370622275] [2024-10-11 10:26:37,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:26:37,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:26:37,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:26:37,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:26:37,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:26:37,681 INFO L87 Difference]: Start difference. First operand 151 states and 236 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:26:38,785 INFO L93 Difference]: Finished difference Result 259 states and 410 transitions. [2024-10-11 10:26:38,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:26:38,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 209 [2024-10-11 10:26:38,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:26:38,789 INFO L225 Difference]: With dead ends: 259 [2024-10-11 10:26:38,789 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 10:26:38,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:26:38,792 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 28 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:26:38,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 270 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 10:26:38,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 10:26:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2024-10-11 10:26:38,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 86 states have (on average 1.255813953488372) internal successors, (108), 86 states have internal predecessors, (108), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 10:26:38,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 244 transitions. [2024-10-11 10:26:38,830 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 244 transitions. Word has length 209 [2024-10-11 10:26:38,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:26:38,831 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 244 transitions. [2024-10-11 10:26:38,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 244 transitions. [2024-10-11 10:26:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-11 10:26:38,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:38,837 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:38,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 10:26:39,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:39,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:39,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:39,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1096544617, now seen corresponding path program 1 times [2024-10-11 10:26:39,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:26:39,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921286711] [2024-10-11 10:26:39,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:39,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:39,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:26:39,043 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:26:39,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 10:26:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:39,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 10:26:39,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:26:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:26:41,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:26:41,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:26:41,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921286711] [2024-10-11 10:26:41,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921286711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:26:41,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:26:41,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:26:41,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071575010] [2024-10-11 10:26:41,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:26:41,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:26:41,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:26:41,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:26:41,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:26:41,120 INFO L87 Difference]: Start difference. First operand 157 states and 244 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:26:44,564 INFO L93 Difference]: Finished difference Result 339 states and 531 transitions. [2024-10-11 10:26:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:26:44,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 211 [2024-10-11 10:26:44,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:26:44,569 INFO L225 Difference]: With dead ends: 339 [2024-10-11 10:26:44,569 INFO L226 Difference]: Without dead ends: 246 [2024-10-11 10:26:44,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:26:44,571 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 36 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 10:26:44,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 253 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 10:26:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-11 10:26:44,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2024-10-11 10:26:44,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 137 states have internal predecessors, (173), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-11 10:26:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 377 transitions. [2024-10-11 10:26:44,605 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 377 transitions. Word has length 211 [2024-10-11 10:26:44,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:26:44,606 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 377 transitions. [2024-10-11 10:26:44,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:44,607 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 377 transitions. [2024-10-11 10:26:44,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-11 10:26:44,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:44,609 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:44,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 10:26:44,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:44,810 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:44,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:44,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2117612971, now seen corresponding path program 1 times [2024-10-11 10:26:44,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:26:44,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765654900] [2024-10-11 10:26:44,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:44,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:44,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:26:44,815 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:26:44,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 10:26:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:45,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 10:26:45,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:26:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:26:45,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:26:45,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:26:45,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765654900] [2024-10-11 10:26:45,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765654900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:26:45,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:26:45,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:26:45,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140819392] [2024-10-11 10:26:45,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:26:45,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:26:45,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:26:45,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:26:45,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:26:45,954 INFO L87 Difference]: Start difference. First operand 243 states and 377 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:47,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:26:48,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:26:48,593 INFO L93 Difference]: Finished difference Result 455 states and 709 transitions. [2024-10-11 10:26:48,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:26:48,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 211 [2024-10-11 10:26:48,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:26:48,619 INFO L225 Difference]: With dead ends: 455 [2024-10-11 10:26:48,619 INFO L226 Difference]: Without dead ends: 280 [2024-10-11 10:26:48,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:26:48,621 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 82 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 10:26:48,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 400 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 10:26:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-11 10:26:48,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2024-10-11 10:26:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 150 states have (on average 1.28) internal successors, (192), 150 states have internal predecessors, (192), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-11 10:26:48,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 396 transitions. [2024-10-11 10:26:48,654 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 396 transitions. Word has length 211 [2024-10-11 10:26:48,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:26:48,655 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 396 transitions. [2024-10-11 10:26:48,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:26:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 396 transitions. [2024-10-11 10:26:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-11 10:26:48,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:48,658 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:48,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 10:26:48,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:48,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:48,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:48,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1048569251, now seen corresponding path program 1 times [2024-10-11 10:26:48,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:26:48,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131102391] [2024-10-11 10:26:48,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:48,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:48,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:26:48,864 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:26:48,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 10:26:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:49,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 10:26:49,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:26:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 285 proven. 93 refuted. 0 times theorem prover too weak. 1866 trivial. 0 not checked. [2024-10-11 10:26:49,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:26:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 6 proven. 93 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-11 10:26:50,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:26:50,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131102391] [2024-10-11 10:26:50,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131102391] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:26:50,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:26:50,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-11 10:26:50,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526544994] [2024-10-11 10:26:50,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:26:50,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 10:26:50,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:26:50,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 10:26:50,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:26:50,567 INFO L87 Difference]: Start difference. First operand 256 states and 396 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) [2024-10-11 10:26:52,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:26:52,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:26:52,481 INFO L93 Difference]: Finished difference Result 355 states and 543 transitions. [2024-10-11 10:26:52,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 10:26:52,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) Word has length 213 [2024-10-11 10:26:52,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:26:52,509 INFO L225 Difference]: With dead ends: 355 [2024-10-11 10:26:52,509 INFO L226 Difference]: Without dead ends: 180 [2024-10-11 10:26:52,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 418 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:26:52,512 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 69 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 10:26:52,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 220 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 10:26:52,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-11 10:26:52,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 173. [2024-10-11 10:26:52,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 100 states have (on average 1.22) internal successors, (122), 100 states have internal predecessors, (122), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 10:26:52,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 258 transitions. [2024-10-11 10:26:52,547 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 258 transitions. Word has length 213 [2024-10-11 10:26:52,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:26:52,550 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 258 transitions. [2024-10-11 10:26:52,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) [2024-10-11 10:26:52,550 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 258 transitions. [2024-10-11 10:26:52,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-11 10:26:52,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:26:52,556 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:26:52,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 10:26:52,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:52,757 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:26:52,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:26:52,757 INFO L85 PathProgramCache]: Analyzing trace with hash 508141483, now seen corresponding path program 1 times [2024-10-11 10:26:52,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:26:52,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186636896] [2024-10-11 10:26:52,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:26:52,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:26:52,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:26:52,759 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:26:52,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 10:26:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:26:53,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 10:26:53,138 INFO L278 TraceCheckSpWp]: Computing forward predicates...