./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.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 a2084c791d87550f3d94f8de030a033d2f092b886e9479453044cdf29085c5fe --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:29:56,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:29:56,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:29:56,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:29:56,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:29:56,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:29:56,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:29:56,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:29:56,803 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:29:56,804 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:29:56,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:29:56,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:29:56,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:29:56,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:29:56,808 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:29:56,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:29:56,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:29:56,809 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:29:56,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:29:56,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:29:56,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:29:56,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:29:56,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:29:56,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:29:56,814 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:29:56,814 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:29:56,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:29:56,815 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:29:56,816 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:29:56,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:29:56,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:29:56,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:29:56,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:29:56,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:29:56,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:29:56,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:29:56,819 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:29:56,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:29:56,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:29:56,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:29:56,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:29:56,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:29:56,820 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 -> a2084c791d87550f3d94f8de030a033d2f092b886e9479453044cdf29085c5fe [2024-10-11 09:29:57,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:29:57,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:29:57,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:29:57,107 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:29:57,108 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:29:57,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i [2024-10-11 09:29:58,663 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:29:58,912 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:29:58,913 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i [2024-10-11 09:29:58,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/42c821bc0/d736f1ef244b401b91b8ab2f95440a78/FLAG6d5786fd2 [2024-10-11 09:29:59,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/42c821bc0/d736f1ef244b401b91b8ab2f95440a78 [2024-10-11 09:29:59,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:29:59,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:29:59,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:29:59,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:29:59,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:29:59,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:29:59" (1/1) ... [2024-10-11 09:29:59,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c23041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:59, skipping insertion in model container [2024-10-11 09:29:59,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:29:59" (1/1) ... [2024-10-11 09:29:59,298 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:29:59,478 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i[919,932] [2024-10-11 09:29:59,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:29:59,568 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:29:59,578 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i[919,932] [2024-10-11 09:29:59,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:29:59,629 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:29:59,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:59 WrapperNode [2024-10-11 09:29:59,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:29:59,631 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:29:59,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:29:59,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:29:59,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:59" (1/1) ... [2024-10-11 09:29:59,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:59" (1/1) ... [2024-10-11 09:29:59,692 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-10-11 09:29:59,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:29:59,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:29:59,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:29:59,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:29:59,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:59" (1/1) ... [2024-10-11 09:29:59,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:59" (1/1) ... [2024-10-11 09:29:59,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:59" (1/1) ... [2024-10-11 09:29:59,727 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:29:59,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:59" (1/1) ... [2024-10-11 09:29:59,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:59" (1/1) ... [2024-10-11 09:29:59,739 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:59" (1/1) ... [2024-10-11 09:29:59,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:59" (1/1) ... [2024-10-11 09:29:59,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:59" (1/1) ... [2024-10-11 09:29:59,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:59" (1/1) ... [2024-10-11 09:29:59,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:29:59,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:29:59,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:29:59,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:29:59,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:59" (1/1) ... [2024-10-11 09:29:59,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:29:59,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:29:59,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:29:59,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:29:59,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:29:59,861 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:29:59,862 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:29:59,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:29:59,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:29:59,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:29:59,969 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:29:59,971 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:30:00,308 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 09:30:00,308 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:30:00,385 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:30:00,385 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 09:30:00,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:30:00 BoogieIcfgContainer [2024-10-11 09:30:00,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:30:00,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:30:00,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:30:00,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:30:00,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:29:59" (1/3) ... [2024-10-11 09:30:00,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea38aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:30:00, skipping insertion in model container [2024-10-11 09:30:00,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:29:59" (2/3) ... [2024-10-11 09:30:00,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea38aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:30:00, skipping insertion in model container [2024-10-11 09:30:00,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:30:00" (3/3) ... [2024-10-11 09:30:00,394 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i [2024-10-11 09:30:00,407 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:30:00,407 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:30:00,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:30:00,500 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;@772a2644, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:30:00,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:30:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 53 states have (on average 1.490566037735849) internal successors, (79), 54 states have internal predecessors, (79), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:30:00,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 09:30:00,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:00,526 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:00,527 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:00,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:00,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1377013323, now seen corresponding path program 1 times [2024-10-11 09:30:00,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:00,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567531913] [2024-10-11 09:30:00,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:00,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:00,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:00,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:30:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:00,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:30:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:00,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:30:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:00,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:30:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:00,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:30:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:00,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:30:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:30:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:30:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:30:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:30:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:30:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:30:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:30:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:30:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:30:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:30:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:30:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:30:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:30:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:30:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:30:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:30:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 09:30:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:30:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:30:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 09:30:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 09:30:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:30:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:30:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:30:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 09:30:01,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:01,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567531913] [2024-10-11 09:30:01,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567531913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:01,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:01,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:30:01,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404421649] [2024-10-11 09:30:01,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:01,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:30:01,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:01,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:30:01,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:30:01,196 INFO L87 Difference]: Start difference. First operand has 88 states, 53 states have (on average 1.490566037735849) internal successors, (79), 54 states have internal predecessors, (79), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 09:30:01,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:01,247 INFO L93 Difference]: Finished difference Result 172 states and 314 transitions. [2024-10-11 09:30:01,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:30:01,250 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 198 [2024-10-11 09:30:01,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:01,258 INFO L225 Difference]: With dead ends: 172 [2024-10-11 09:30:01,258 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 09:30:01,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:30:01,265 INFO L432 NwaCegarLoop]: 132 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, 132 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:01,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:30:01,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 09:30:01,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 09:30:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:30:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 135 transitions. [2024-10-11 09:30:01,316 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 135 transitions. Word has length 198 [2024-10-11 09:30:01,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:01,316 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 135 transitions. [2024-10-11 09:30:01,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 09:30:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 135 transitions. [2024-10-11 09:30:01,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 09:30:01,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:01,322 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:01,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:30:01,323 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:01,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:01,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2055774585, now seen corresponding path program 1 times [2024-10-11 09:30:01,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:01,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679843392] [2024-10-11 09:30:01,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:01,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:30:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:30:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:30:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:30:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:30:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:30:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:30:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:30:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:30:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:30:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:30:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:01,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:30:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:30:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:30:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:30:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:30:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:30:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:30:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:30:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:30:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:30:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:30:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 09:30:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:30:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:30:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 09:30:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 09:30:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:30:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:30:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:30:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 09:30:02,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:02,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679843392] [2024-10-11 09:30:02,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679843392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:02,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:02,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:30:02,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861310630] [2024-10-11 09:30:02,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:02,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:30:02,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:02,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:30:02,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:30:02,128 INFO L87 Difference]: Start difference. First operand 85 states and 135 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:30:02,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:02,399 INFO L93 Difference]: Finished difference Result 254 states and 404 transitions. [2024-10-11 09:30:02,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:30:02,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2024-10-11 09:30:02,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:02,403 INFO L225 Difference]: With dead ends: 254 [2024-10-11 09:30:02,404 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 09:30:02,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:30:02,406 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 95 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:02,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 382 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:30:02,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 09:30:02,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 141. [2024-10-11 09:30:02,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 09:30:02,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 222 transitions. [2024-10-11 09:30:02,447 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 222 transitions. Word has length 198 [2024-10-11 09:30:02,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:02,448 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 222 transitions. [2024-10-11 09:30:02,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:30:02,448 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 222 transitions. [2024-10-11 09:30:02,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 09:30:02,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:02,453 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:02,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:30:02,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:02,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:02,455 INFO L85 PathProgramCache]: Analyzing trace with hash -584818089, now seen corresponding path program 1 times [2024-10-11 09:30:02,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:02,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124290578] [2024-10-11 09:30:02,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:02,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:30:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:30:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:30:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:30:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:30:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:30:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:30:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:30:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:30:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:30:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:30:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:30:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:30:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:30:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:30:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:30:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:30:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:30:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:30:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:30:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:02,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:30:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:30:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 09:30:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:30:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:30:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 09:30:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 09:30:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:30:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:30:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:30:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 09:30:03,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:03,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124290578] [2024-10-11 09:30:03,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124290578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:03,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:03,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:30:03,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421074232] [2024-10-11 09:30:03,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:03,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:30:03,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:03,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:30:03,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:30:03,062 INFO L87 Difference]: Start difference. First operand 141 states and 222 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:30:03,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:03,377 INFO L93 Difference]: Finished difference Result 316 states and 498 transitions. [2024-10-11 09:30:03,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:30:03,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 199 [2024-10-11 09:30:03,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:03,385 INFO L225 Difference]: With dead ends: 316 [2024-10-11 09:30:03,385 INFO L226 Difference]: Without dead ends: 232 [2024-10-11 09:30:03,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:30:03,387 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 115 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:03,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 461 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:30:03,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-11 09:30:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 223. [2024-10-11 09:30:03,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 123 states have (on average 1.3170731707317074) internal successors, (162), 123 states have internal predecessors, (162), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 09:30:03,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 354 transitions. [2024-10-11 09:30:03,457 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 354 transitions. Word has length 199 [2024-10-11 09:30:03,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:03,460 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 354 transitions. [2024-10-11 09:30:03,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:30:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 354 transitions. [2024-10-11 09:30:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-11 09:30:03,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:03,463 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:03,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:30:03,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:03,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:03,464 INFO L85 PathProgramCache]: Analyzing trace with hash -392627584, now seen corresponding path program 1 times [2024-10-11 09:30:03,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:03,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837283225] [2024-10-11 09:30:03,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:03,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:30:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:30:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:30:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:30:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:30:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:30:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:30:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:30:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:30:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:30:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:30:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:30:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:30:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:30:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:30:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:30:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:30:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:30:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:30:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:30:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:30:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:30:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 09:30:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:30:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:30:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 09:30:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 09:30:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:30:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:30:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:30:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 09:30:03,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:03,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837283225] [2024-10-11 09:30:03,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837283225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:03,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:03,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:30:03,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454081008] [2024-10-11 09:30:03,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:03,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:30:03,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:03,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:30:03,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:30:03,766 INFO L87 Difference]: Start difference. First operand 223 states and 354 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:30:03,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:03,814 INFO L93 Difference]: Finished difference Result 408 states and 653 transitions. [2024-10-11 09:30:03,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:30:03,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 200 [2024-10-11 09:30:03,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:03,818 INFO L225 Difference]: With dead ends: 408 [2024-10-11 09:30:03,818 INFO L226 Difference]: Without dead ends: 242 [2024-10-11 09:30:03,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:30:03,820 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 33 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:03,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 286 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:30:03,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-11 09:30:03,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 223. [2024-10-11 09:30:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 123 states have (on average 1.3008130081300813) internal successors, (160), 123 states have internal predecessors, (160), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 09:30:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 352 transitions. [2024-10-11 09:30:03,850 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 352 transitions. Word has length 200 [2024-10-11 09:30:03,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:03,850 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 352 transitions. [2024-10-11 09:30:03,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:30:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 352 transitions. [2024-10-11 09:30:03,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-11 09:30:03,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:03,853 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:03,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:30:03,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:03,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:03,854 INFO L85 PathProgramCache]: Analyzing trace with hash -942062046, now seen corresponding path program 1 times [2024-10-11 09:30:03,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:03,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206302189] [2024-10-11 09:30:03,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:03,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:30:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:30:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:30:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:30:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:30:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:30:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:30:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:30:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:30:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:30:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:30:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:30:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:30:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:30:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:30:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:30:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:30:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:30:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:30:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:30:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:30:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:30:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 09:30:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:30:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:30:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 09:30:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 09:30:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:30:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:30:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:30:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 24 proven. 69 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 09:30:04,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:04,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206302189] [2024-10-11 09:30:04,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206302189] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:30:04,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808513942] [2024-10-11 09:30:04,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:04,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:30:04,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:30:04,265 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:30:04,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:30:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:04,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 09:30:04,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:30:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 783 proven. 69 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2024-10-11 09:30:04,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:30:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 24 proven. 69 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 09:30:04,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808513942] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:30:04,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:30:04,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-11 09:30:04,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480059269] [2024-10-11 09:30:04,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:30:04,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:30:04,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:04,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:30:04,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:30:04,952 INFO L87 Difference]: Start difference. First operand 223 states and 352 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2024-10-11 09:30:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:05,248 INFO L93 Difference]: Finished difference Result 407 states and 631 transitions. [2024-10-11 09:30:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 09:30:05,249 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) Word has length 201 [2024-10-11 09:30:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:05,253 INFO L225 Difference]: With dead ends: 407 [2024-10-11 09:30:05,253 INFO L226 Difference]: Without dead ends: 241 [2024-10-11 09:30:05,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:30:05,257 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 189 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:05,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 190 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:30:05,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-11 09:30:05,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 235. [2024-10-11 09:30:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 132 states have (on average 1.2651515151515151) internal successors, (167), 132 states have internal predecessors, (167), 96 states have call successors, (96), 6 states have call predecessors, (96), 6 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 09:30:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 359 transitions. [2024-10-11 09:30:05,302 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 359 transitions. Word has length 201 [2024-10-11 09:30:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:05,303 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 359 transitions. [2024-10-11 09:30:05,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2024-10-11 09:30:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 359 transitions. [2024-10-11 09:30:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-11 09:30:05,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:05,306 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:05,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 09:30:05,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:30:05,508 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:05,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:05,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2073041572, now seen corresponding path program 1 times [2024-10-11 09:30:05,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:05,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907222169] [2024-10-11 09:30:05,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:05,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:30:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:30:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:30:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:30:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:30:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:30:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:30:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:30:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:30:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:30:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:30:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:30:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:30:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:30:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:30:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:30:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:30:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:30:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:30:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:30:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:30:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:30:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 09:30:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:30:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:30:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 09:30:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 09:30:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:30:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:30:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:30:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 09:30:05,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:05,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907222169] [2024-10-11 09:30:05,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907222169] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:30:05,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059134870] [2024-10-11 09:30:05,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:05,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:30:05,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:30:06,000 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:30:06,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:30:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:06,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 09:30:06,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:30:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1003 proven. 39 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2024-10-11 09:30:06,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:30:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 09:30:06,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059134870] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:30:06,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:30:06,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-10-11 09:30:06,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992351489] [2024-10-11 09:30:06,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:30:06,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:30:06,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:06,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:30:06,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:30:06,630 INFO L87 Difference]: Start difference. First operand 235 states and 359 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-11 09:30:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:07,243 INFO L93 Difference]: Finished difference Result 549 states and 822 transitions. [2024-10-11 09:30:07,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 09:30:07,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 201 [2024-10-11 09:30:07,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:07,248 INFO L225 Difference]: With dead ends: 549 [2024-10-11 09:30:07,248 INFO L226 Difference]: Without dead ends: 375 [2024-10-11 09:30:07,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 461 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-11 09:30:07,250 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 146 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:07,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 444 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:30:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-11 09:30:07,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 259. [2024-10-11 09:30:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 153 states have (on average 1.2549019607843137) internal successors, (192), 153 states have internal predecessors, (192), 96 states have call successors, (96), 9 states have call predecessors, (96), 9 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 09:30:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 384 transitions. [2024-10-11 09:30:07,309 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 384 transitions. Word has length 201 [2024-10-11 09:30:07,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:07,310 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 384 transitions. [2024-10-11 09:30:07,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-11 09:30:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 384 transitions. [2024-10-11 09:30:07,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-11 09:30:07,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:07,314 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:07,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 09:30:07,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:30:07,515 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:07,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1390441428, now seen corresponding path program 1 times [2024-10-11 09:30:07,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:07,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535114048] [2024-10-11 09:30:07,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:07,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:30:07,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [483134157] [2024-10-11 09:30:07,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:07,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:30:07,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:30:07,618 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:30:07,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 09:30:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:07,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 09:30:07,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:30:08,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1457 proven. 87 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2024-10-11 09:30:08,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:30:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 78 proven. 15 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 09:30:10,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:10,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535114048] [2024-10-11 09:30:10,517 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 09:30:10,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483134157] [2024-10-11 09:30:10,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483134157] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:30:10,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:30:10,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2024-10-11 09:30:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632391269] [2024-10-11 09:30:10,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:30:10,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 09:30:10,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:10,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 09:30:10,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2024-10-11 09:30:10,522 INFO L87 Difference]: Start difference. First operand 259 states and 384 transitions. Second operand has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 8 states have call successors, (51), 5 states have call predecessors, (51), 9 states have return successors, (52), 10 states have call predecessors, (52), 8 states have call successors, (52) [2024-10-11 09:30:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:12,084 INFO L93 Difference]: Finished difference Result 525 states and 734 transitions. [2024-10-11 09:30:12,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 09:30:12,085 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 8 states have call successors, (51), 5 states have call predecessors, (51), 9 states have return successors, (52), 10 states have call predecessors, (52), 8 states have call successors, (52) Word has length 203 [2024-10-11 09:30:12,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:12,088 INFO L225 Difference]: With dead ends: 525 [2024-10-11 09:30:12,088 INFO L226 Difference]: Without dead ends: 331 [2024-10-11 09:30:12,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=291, Invalid=639, Unknown=0, NotChecked=0, Total=930 [2024-10-11 09:30:12,090 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 105 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:12,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 233 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 09:30:12,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-11 09:30:12,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 307. [2024-10-11 09:30:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 189 states have (on average 1.1957671957671958) internal successors, (226), 189 states have internal predecessors, (226), 96 states have call successors, (96), 21 states have call predecessors, (96), 21 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 09:30:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 418 transitions. [2024-10-11 09:30:12,156 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 418 transitions. Word has length 203 [2024-10-11 09:30:12,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:12,157 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 418 transitions. [2024-10-11 09:30:12,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 8 states have call successors, (51), 5 states have call predecessors, (51), 9 states have return successors, (52), 10 states have call predecessors, (52), 8 states have call successors, (52) [2024-10-11 09:30:12,157 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 418 transitions. [2024-10-11 09:30:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-11 09:30:12,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:12,161 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:12,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 09:30:12,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:30:12,366 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:12,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1390381846, now seen corresponding path program 1 times [2024-10-11 09:30:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:12,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928028152] [2024-10-11 09:30:12,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:12,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:30:12,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419156370] [2024-10-11 09:30:12,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:12,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:30:12,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:30:12,491 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:30:12,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 09:30:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:30:12,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:30:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:30:12,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:30:12,843 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:30:12,844 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:30:12,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 09:30:13,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 09:30:13,050 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:13,201 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:30:13,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:30:13 BoogieIcfgContainer [2024-10-11 09:30:13,205 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:30:13,206 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:30:13,206 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:30:13,206 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:30:13,207 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:30:00" (3/4) ... [2024-10-11 09:30:13,208 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:30:13,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:30:13,210 INFO L158 Benchmark]: Toolchain (without parser) took 13962.81ms. Allocated memory was 165.7MB in the beginning and 312.5MB in the end (delta: 146.8MB). Free memory was 114.6MB in the beginning and 260.6MB in the end (delta: -146.0MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2024-10-11 09:30:13,210 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 165.7MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:30:13,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.71ms. Allocated memory is still 165.7MB. Free memory was 114.6MB in the beginning and 96.4MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 09:30:13,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.56ms. Allocated memory is still 165.7MB. Free memory was 96.4MB in the beginning and 92.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:30:13,211 INFO L158 Benchmark]: Boogie Preprocessor took 72.20ms. Allocated memory is still 165.7MB. Free memory was 92.8MB in the beginning and 88.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:30:13,211 INFO L158 Benchmark]: RCFGBuilder took 619.88ms. Allocated memory is still 165.7MB. Free memory was 88.7MB in the beginning and 59.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 09:30:13,211 INFO L158 Benchmark]: TraceAbstraction took 12817.46ms. Allocated memory was 165.7MB in the beginning and 312.5MB in the end (delta: 146.8MB). Free memory was 58.7MB in the beginning and 260.6MB in the end (delta: -201.9MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. [2024-10-11 09:30:13,212 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 312.5MB. Free memory is still 260.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:30:13,213 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.18ms. Allocated memory is still 165.7MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.71ms. Allocated memory is still 165.7MB. Free memory was 114.6MB in the beginning and 96.4MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.56ms. Allocated memory is still 165.7MB. Free memory was 96.4MB in the beginning and 92.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.20ms. Allocated memory is still 165.7MB. Free memory was 92.8MB in the beginning and 88.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 619.88ms. Allocated memory is still 165.7MB. Free memory was 88.7MB in the beginning and 59.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12817.46ms. Allocated memory was 165.7MB in the beginning and 312.5MB in the end (delta: 146.8MB). Free memory was 58.7MB in the beginning and 260.6MB in the end (delta: -201.9MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 312.5MB. Free memory is still 260.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 206, overapproximation of someBinaryFLOATComparisonOperation at line 194, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] float var_1_25 = -0.575; [L41] signed char var_1_27 = 5; [L42] signed char var_1_28 = 1; [L43] float var_1_30 = 10.8; [L44] float var_1_31 = 49.2; [L45] float var_1_32 = 0.4; [L46] unsigned char var_1_33 = 10; [L47] unsigned char var_1_37 = 64; [L48] signed char var_1_38 = -8; [L49] unsigned short int var_1_40 = 200; [L50] unsigned long int var_1_42 = 2; [L51] unsigned long int var_1_44 = 10; [L52] unsigned short int var_1_45 = 16; [L53] unsigned char last_1_var_1_1 = 128; [L54] unsigned long int last_1_var_1_12 = 8; [L55] double last_1_var_1_17 = 256.8; [L56] unsigned char last_1_var_1_21 = 1; [L210] isInitial = 1 [L211] FCALL initially() [L212] COND TRUE 1 [L213] CALL updateLastVariables() [L200] last_1_var_1_1 = var_1_1 [L201] last_1_var_1_12 = var_1_12 [L202] last_1_var_1_17 = var_1_17 [L203] last_1_var_1_21 = var_1_21 [L213] RET updateLastVariables() [L214] CALL updateVariables() [L148] var_1_4 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L149] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L150] var_1_5 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=2, var_1_8=-10, var_1_9=5] [L151] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=2, var_1_8=-10, var_1_9=5] [L152] var_1_7 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_8=-10, var_1_9=5] [L153] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_8=-10, var_1_9=5] [L154] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=5] [L154] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=5] [L155] var_1_9 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L156] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L157] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L158] var_1_10 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L159] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L160] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L161] var_1_11 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L162] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L163] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L164] var_1_13 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L165] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L166] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L166] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L167] var_1_15 = __VERIFIER_nondet_ulong() [L168] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L168] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L169] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L169] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L170] var_1_18 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L171] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L172] var_1_22 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L173] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L174] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L174] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L175] var_1_23 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L176] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L177] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L178] var_1_24 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L179] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L180] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L180] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L181] var_1_27 = __VERIFIER_nondet_char() [L182] CALL assume_abort_if_not(var_1_27 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L182] RET assume_abort_if_not(var_1_27 >= -128) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L183] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L183] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L184] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L184] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L185] var_1_28 = __VERIFIER_nondet_char() [L186] CALL assume_abort_if_not(var_1_28 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L186] RET assume_abort_if_not(var_1_28 >= -128) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L187] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L187] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L188] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L188] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L189] var_1_30 = __VERIFIER_nondet_float() [L190] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L190] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L191] var_1_31 = __VERIFIER_nondet_float() [L192] CALL assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L192] RET assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L193] var_1_32 = __VERIFIER_nondet_float() [L194] CALL assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L194] RET assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L195] var_1_37 = __VERIFIER_nondet_uchar() [L196] CALL assume_abort_if_not(var_1_37 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L196] RET assume_abort_if_not(var_1_37 >= 64) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L197] CALL assume_abort_if_not(var_1_37 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L197] RET assume_abort_if_not(var_1_37 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L214] RET updateVariables() [L215] CALL step() [L60] unsigned char stepLocal_3 = ((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L61] COND TRUE last_1_var_1_21 || stepLocal_3 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L62] COND TRUE var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17))) [L63] var_1_19 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L70] var_1_38 = var_1_10 [L71] unsigned long int stepLocal_1 = last_1_var_1_12; [L72] unsigned long int stepLocal_0 = 32u; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=0, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L73] COND TRUE stepLocal_0 >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_1=8, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=0, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L74] COND TRUE stepLocal_1 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=0, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L75] COND TRUE (var_1_4 - var_1_5) >= last_1_var_1_17 [L76] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=0, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L82] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=0, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L85] COND TRUE var_1_32 < ((((var_1_30) > (((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) ? (var_1_30) : (((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) [L86] var_1_33 = ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L93] var_1_40 = var_1_11 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L99] var_1_44 = (((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) + (((((((var_1_7) > (var_1_7)) ? (var_1_7) : (var_1_7))) < 0 ) ? -((((var_1_7) > (var_1_7)) ? (var_1_7) : (var_1_7))) : ((((var_1_7) > (var_1_7)) ? (var_1_7) : (var_1_7)))))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=2, var_1_44=64, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L100] COND TRUE ! (var_1_17 > var_1_5) [L101] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=2, var_1_44=64, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L105] unsigned long int stepLocal_4 = var_1_19; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=2, var_1_44=64, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L106] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L117] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=2, var_1_44=64, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L119] COND FALSE !(((((1.000000095E7f) < 0 ) ? -(1.000000095E7f) : (1.000000095E7f))) < ((9.9999999999996E12f - var_1_31) / var_1_22)) [L124] var_1_42 = 100000u VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L126] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L129] COND TRUE var_1_15 > ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) [L130] var_1_45 = var_1_11 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=0, var_1_8=0, var_1_9=0] [L135] unsigned char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_2=0, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=0, var_1_8=0, var_1_9=0] [L136] COND FALSE !(var_1_21 && stepLocal_2) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=0, var_1_8=0, var_1_9=0] [L139] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=0, var_1_8=0, var_1_9=0] [L143] COND FALSE !((var_1_15 % ((((var_1_27) > (var_1_28)) ? (var_1_27) : (var_1_28)))) > var_1_15) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=0, var_1_8=0, var_1_9=0] [L215] RET step() [L216] CALL, EXPR property() [L206-L207] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; [L216] RET, EXPR property() [L216] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 8, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 722 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 2128 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1228 mSDsCounter, 412 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1047 IncrementalHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 412 mSolverCounterUnsat, 900 mSDtfsCounter, 1047 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1677 GetRequests, 1608 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=7, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 203 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2411 NumberOfCodeBlocks, 2411 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2395 ConstructedInterpolants, 0 QuantifiedInterpolants, 7769 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1383 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 23382/23808 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 09:30:13,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.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 a2084c791d87550f3d94f8de030a033d2f092b886e9479453044cdf29085c5fe --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:30:15,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:30:15,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:30:15,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:30:15,619 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:30:15,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:30:15,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:30:15,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:30:15,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:30:15,657 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:30:15,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:30:15,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:30:15,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:30:15,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:30:15,659 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:30:15,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:30:15,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:30:15,660 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:30:15,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:30:15,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:30:15,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:30:15,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:30:15,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:30:15,663 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:30:15,664 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:30:15,664 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:30:15,664 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:30:15,665 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:30:15,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:30:15,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:30:15,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:30:15,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:30:15,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:30:15,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:30:15,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:30:15,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:30:15,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:30:15,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:30:15,669 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:30:15,669 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:30:15,669 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:30:15,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:30:15,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:30:15,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:30:15,671 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:30:15,671 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 -> a2084c791d87550f3d94f8de030a033d2f092b886e9479453044cdf29085c5fe [2024-10-11 09:30:16,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:30:16,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:30:16,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:30:16,060 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:30:16,061 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:30:16,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i [2024-10-11 09:30:17,673 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:30:17,904 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:30:17,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i [2024-10-11 09:30:17,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/794568479/087417f1ba4e48508081c503f88bc8a5/FLAGed13e43ac [2024-10-11 09:30:18,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/794568479/087417f1ba4e48508081c503f88bc8a5 [2024-10-11 09:30:18,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:30:18,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:30:18,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:30:18,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:30:18,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:30:18,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:30:18" (1/1) ... [2024-10-11 09:30:18,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb6ca3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:18, skipping insertion in model container [2024-10-11 09:30:18,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:30:18" (1/1) ... [2024-10-11 09:30:18,298 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:30:18,482 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i[919,932] [2024-10-11 09:30:18,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:30:18,593 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:30:18,608 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i[919,932] [2024-10-11 09:30:18,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:30:18,680 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:30:18,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:18 WrapperNode [2024-10-11 09:30:18,681 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:30:18,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:30:18,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:30:18,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:30:18,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:18" (1/1) ... [2024-10-11 09:30:18,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:18" (1/1) ... [2024-10-11 09:30:18,752 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-10-11 09:30:18,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:30:18,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:30:18,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:30:18,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:30:18,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:18" (1/1) ... [2024-10-11 09:30:18,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:18" (1/1) ... [2024-10-11 09:30:18,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:18" (1/1) ... [2024-10-11 09:30:18,790 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:30:18,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:18" (1/1) ... [2024-10-11 09:30:18,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:18" (1/1) ... [2024-10-11 09:30:18,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:18" (1/1) ... [2024-10-11 09:30:18,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:18" (1/1) ... [2024-10-11 09:30:18,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:18" (1/1) ... [2024-10-11 09:30:18,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:18" (1/1) ... [2024-10-11 09:30:18,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:30:18,836 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:30:18,836 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:30:18,836 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:30:18,837 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:18" (1/1) ... [2024-10-11 09:30:18,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:30:18,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:30:18,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:30:18,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:30:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:30:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:30:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:30:18,924 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:30:18,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:30:18,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:30:19,034 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:30:19,036 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:30:45,303 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 09:30:45,304 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:30:45,386 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:30:45,387 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 09:30:45,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:30:45 BoogieIcfgContainer [2024-10-11 09:30:45,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:30:45,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:30:45,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:30:45,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:30:45,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:30:18" (1/3) ... [2024-10-11 09:30:45,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7796b508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:30:45, skipping insertion in model container [2024-10-11 09:30:45,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:18" (2/3) ... [2024-10-11 09:30:45,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7796b508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:30:45, skipping insertion in model container [2024-10-11 09:30:45,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:30:45" (3/3) ... [2024-10-11 09:30:45,400 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i [2024-10-11 09:30:45,417 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:30:45,418 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:30:45,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:30:45,520 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;@78a706f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:30:45,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:30:45,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 53 states have (on average 1.490566037735849) internal successors, (79), 54 states have internal predecessors, (79), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:30:45,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 09:30:45,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:45,542 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:45,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:45,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:45,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1377013323, now seen corresponding path program 1 times [2024-10-11 09:30:45,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:30:45,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108766274] [2024-10-11 09:30:45,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:45,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:30:45,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:30:45,569 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:30:45,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 09:30:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:47,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:30:47,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:30:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 942 proven. 0 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2024-10-11 09:30:47,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:30:47,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:30:47,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108766274] [2024-10-11 09:30:47,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108766274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:47,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:47,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:30:47,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608388496] [2024-10-11 09:30:47,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:47,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:30:47,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:30:47,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:30:47,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:30:47,295 INFO L87 Difference]: Start difference. First operand has 88 states, 53 states have (on average 1.490566037735849) internal successors, (79), 54 states have internal predecessors, (79), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) 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, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 09:30:51,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:30:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:51,620 INFO L93 Difference]: Finished difference Result 172 states and 314 transitions. [2024-10-11 09:30:51,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:30:51,708 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, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 198 [2024-10-11 09:30:51,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:51,715 INFO L225 Difference]: With dead ends: 172 [2024-10-11 09:30:51,716 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 09:30:51,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:30:51,726 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:51,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 09:30:51,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 09:30:51,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 09:30:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:30:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 135 transitions. [2024-10-11 09:30:51,769 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 135 transitions. Word has length 198 [2024-10-11 09:30:51,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:51,770 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 135 transitions. [2024-10-11 09:30:51,770 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, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 09:30:51,770 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 135 transitions. [2024-10-11 09:30:51,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 09:30:51,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:51,777 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:51,817 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 09:30:51,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:30:51,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:51,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:51,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2055774585, now seen corresponding path program 1 times [2024-10-11 09:30:51,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:30:51,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34549178] [2024-10-11 09:30:51,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:51,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:30:51,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:30:51,988 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:30:51,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 09:30:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:53,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 09:30:53,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:31:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 09:31:00,347 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:31:00,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:31:00,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34549178] [2024-10-11 09:31:00,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34549178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:31:00,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:31:00,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:31:00,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962854239] [2024-10-11 09:31:00,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:31:00,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:31:00,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:31:00,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:31:00,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:31:00,351 INFO L87 Difference]: Start difference. First operand 85 states and 135 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:31:02,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:31:06,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:31:10,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:31:15,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:31:19,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:31:23,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:31:23,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:31:23,364 INFO L93 Difference]: Finished difference Result 254 states and 404 transitions. [2024-10-11 09:31:23,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:31:23,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2024-10-11 09:31:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:31:23,454 INFO L225 Difference]: With dead ends: 254 [2024-10-11 09:31:23,454 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 09:31:23,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:31:23,456 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 92 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 65 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2024-10-11 09:31:23,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 382 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 22.9s Time] [2024-10-11 09:31:23,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 09:31:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 141. [2024-10-11 09:31:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 09:31:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 222 transitions. [2024-10-11 09:31:23,514 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 222 transitions. Word has length 198 [2024-10-11 09:31:23,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:31:23,515 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 222 transitions. [2024-10-11 09:31:23,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:31:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 222 transitions. [2024-10-11 09:31:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 09:31:23,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:31:23,518 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:31:23,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 09:31:23,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:31:23,720 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:31:23,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:31:23,720 INFO L85 PathProgramCache]: Analyzing trace with hash -584818089, now seen corresponding path program 1 times [2024-10-11 09:31:23,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:31:23,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902619496] [2024-10-11 09:31:23,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:23,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:31:23,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:31:23,725 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:31:23,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 09:31:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:25,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 09:31:25,113 INFO L278 TraceCheckSpWp]: Computing forward predicates...