./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-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bcb802c44fca05d9a0a95a2e14fa4747615929a328e29a7c11119462c0cec4c4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:23:53,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:23:53,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 07:23:53,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:23:53,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:23:53,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:23:53,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:23:53,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:23:53,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:23:53,817 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:23:53,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:23:53,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:23:53,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:23:53,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:23:53,819 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:23:53,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:23:53,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:23:53,822 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:23:53,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 07:23:53,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:23:53,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:23:53,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:23:53,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:23:53,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:23:53,829 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:23:53,829 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:23:53,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:23:53,830 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:23:53,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:23:53,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:23:53,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:23:53,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:23:53,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:23:53,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:23:53,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:23:53,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:23:53,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 07:23:53,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 07:23:53,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:23:53,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:23:53,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:23:53,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:23:53,834 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bcb802c44fca05d9a0a95a2e14fa4747615929a328e29a7c11119462c0cec4c4 [2024-10-24 07:23:54,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:23:54,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:23:54,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:23:54,116 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:23:54,116 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:23:54,118 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-1.i [2024-10-24 07:23:55,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:23:55,813 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:23:55,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-1.i [2024-10-24 07:23:55,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91e31f157/f94dfd8e78034a45b257fa5383a5c8d1/FLAG7044fb5ae [2024-10-24 07:23:56,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91e31f157/f94dfd8e78034a45b257fa5383a5c8d1 [2024-10-24 07:23:56,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:23:56,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:23:56,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:23:56,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:23:56,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:23:56,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:23:56" (1/1) ... [2024-10-24 07:23:56,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1293c468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:23:56, skipping insertion in model container [2024-10-24 07:23:56,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:23:56" (1/1) ... [2024-10-24 07:23:56,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:23:56,382 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-1.i[918,931] [2024-10-24 07:23:56,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:23:56,465 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:23:56,476 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-1.i[918,931] [2024-10-24 07:23:56,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:23:56,535 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:23:56,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:23:56 WrapperNode [2024-10-24 07:23:56,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:23:56,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:23:56,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:23:56,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:23:56,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:23:56" (1/1) ... [2024-10-24 07:23:56,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:23:56" (1/1) ... [2024-10-24 07:23:56,596 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2024-10-24 07:23:56,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:23:56,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:23:56,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:23:56,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:23:56,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:23:56" (1/1) ... [2024-10-24 07:23:56,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:23:56" (1/1) ... [2024-10-24 07:23:56,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:23:56" (1/1) ... [2024-10-24 07:23:56,643 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-24 07:23:56,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:23:56" (1/1) ... [2024-10-24 07:23:56,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:23:56" (1/1) ... [2024-10-24 07:23:56,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:23:56" (1/1) ... [2024-10-24 07:23:56,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:23:56" (1/1) ... [2024-10-24 07:23:56,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:23:56" (1/1) ... [2024-10-24 07:23:56,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:23:56" (1/1) ... [2024-10-24 07:23:56,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:23:56,693 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:23:56,693 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:23:56,693 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:23:56,694 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:23:56" (1/1) ... [2024-10-24 07:23:56,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:23:56,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:23:56,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 07:23:56,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 07:23:56,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:23:56,770 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:23:56,770 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:23:56,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 07:23:56,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:23:56,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:23:56,843 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:23:56,845 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:23:57,237 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 07:23:57,238 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:23:57,280 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:23:57,281 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:23:57,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:23:57 BoogieIcfgContainer [2024-10-24 07:23:57,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:23:57,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:23:57,296 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:23:57,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:23:57,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:23:56" (1/3) ... [2024-10-24 07:23:57,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ed2405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:23:57, skipping insertion in model container [2024-10-24 07:23:57,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:23:56" (2/3) ... [2024-10-24 07:23:57,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ed2405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:23:57, skipping insertion in model container [2024-10-24 07:23:57,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:23:57" (3/3) ... [2024-10-24 07:23:57,309 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-1.i [2024-10-24 07:23:57,324 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:23:57,325 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:23:57,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:23:57,419 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;@22951509, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:23:57,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:23:57,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 58 states have internal predecessors, (86), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 07:23:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 07:23:57,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:23:57,435 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:23:57,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:23:57,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:23:57,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1272118405, now seen corresponding path program 1 times [2024-10-24 07:23:57,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:23:57,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099126205] [2024-10-24 07:23:57,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:23:57,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:23:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:23:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:23:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:23:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:23:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:23:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:23:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:23:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:23:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:23:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:23:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:23:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:23:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:23:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:23:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:23:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:23:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:23:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:23:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:23:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:23:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:23:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:23:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:23:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:23:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:23:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:23:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:23:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:23:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:23:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:23:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 07:23:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:23:57,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:23:57,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099126205] [2024-10-24 07:23:57,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099126205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:23:57,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:23:57,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:23:57,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424506820] [2024-10-24 07:23:57,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:23:57,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:23:57,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:23:58,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:23:58,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:23:58,016 INFO L87 Difference]: Start difference. First operand has 91 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 58 states have internal predecessors, (86), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 07:23:58,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:23:58,069 INFO L93 Difference]: Finished difference Result 179 states and 325 transitions. [2024-10-24 07:23:58,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:23:58,072 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 196 [2024-10-24 07:23:58,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:23:58,081 INFO L225 Difference]: With dead ends: 179 [2024-10-24 07:23:58,082 INFO L226 Difference]: Without dead ends: 89 [2024-10-24 07:23:58,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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-24 07:23:58,091 INFO L432 NwaCegarLoop]: 139 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, 139 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:23:58,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:23:58,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-24 07:23:58,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-24 07:23:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 56 states have internal predecessors, (80), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 07:23:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 142 transitions. [2024-10-24 07:23:58,143 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 142 transitions. Word has length 196 [2024-10-24 07:23:58,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:23:58,143 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 142 transitions. [2024-10-24 07:23:58,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 07:23:58,144 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2024-10-24 07:23:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 07:23:58,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:23:58,148 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:23:58,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 07:23:58,149 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:23:58,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:23:58,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2041670789, now seen corresponding path program 1 times [2024-10-24 07:23:58,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:23:58,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725763090] [2024-10-24 07:23:58,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:23:58,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:23:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:23:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:23:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:23:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:23:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:23:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:23:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:23:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:23:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:23:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:23:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:23:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:23:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:23:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:23:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:23:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:23:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:23:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:23:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:23:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:23:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:23:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:23:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:23:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:23:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:23:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:23:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:23:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:23:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:23:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:23:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 07:23:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:58,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:23:58,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:23:58,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725763090] [2024-10-24 07:23:58,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725763090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:23:58,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:23:58,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:23:58,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178075928] [2024-10-24 07:23:58,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:23:58,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:23:58,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:23:58,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:23:58,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:23:58,761 INFO L87 Difference]: Start difference. First operand 89 states and 142 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:23:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:23:59,096 INFO L93 Difference]: Finished difference Result 262 states and 419 transitions. [2024-10-24 07:23:59,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:23:59,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-24 07:23:59,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:23:59,102 INFO L225 Difference]: With dead ends: 262 [2024-10-24 07:23:59,102 INFO L226 Difference]: Without dead ends: 174 [2024-10-24 07:23:59,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 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-24 07:23:59,105 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 130 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:23:59,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 302 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 07:23:59,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-24 07:23:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 110. [2024-10-24 07:23:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 77 states have internal predecessors, (116), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 07:23:59,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 178 transitions. [2024-10-24 07:23:59,142 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 178 transitions. Word has length 196 [2024-10-24 07:23:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:23:59,144 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 178 transitions. [2024-10-24 07:23:59,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:23:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 178 transitions. [2024-10-24 07:23:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 07:23:59,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:23:59,153 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:23:59,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 07:23:59,153 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:23:59,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:23:59,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2043517831, now seen corresponding path program 1 times [2024-10-24 07:23:59,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:23:59,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853459934] [2024-10-24 07:23:59,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:23:59,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:23:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:23:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:23:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:23:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:23:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:23:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:23:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:23:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:23:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:23:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:23:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:23:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:23:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:23:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:23:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:23:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:23:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:23:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:23:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:23:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:23:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:23:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:23:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:23:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:23:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:23:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:23:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:23:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:23:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:23:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:23:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 07:23:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:23:59,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:23:59,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853459934] [2024-10-24 07:23:59,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853459934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:23:59,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:23:59,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:23:59,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237937985] [2024-10-24 07:23:59,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:23:59,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:23:59,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:23:59,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:23:59,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:23:59,473 INFO L87 Difference]: Start difference. First operand 110 states and 178 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:23:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:23:59,571 INFO L93 Difference]: Finished difference Result 283 states and 453 transitions. [2024-10-24 07:23:59,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:23:59,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-24 07:23:59,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:23:59,576 INFO L225 Difference]: With dead ends: 283 [2024-10-24 07:23:59,579 INFO L226 Difference]: Without dead ends: 174 [2024-10-24 07:23:59,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:23:59,581 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 118 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:23:59,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 324 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:23:59,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-24 07:23:59,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2024-10-24 07:23:59,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 07:23:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 271 transitions. [2024-10-24 07:23:59,617 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 271 transitions. Word has length 196 [2024-10-24 07:23:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:23:59,620 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 271 transitions. [2024-10-24 07:23:59,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:23:59,620 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 271 transitions. [2024-10-24 07:23:59,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 07:23:59,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:23:59,622 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:23:59,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 07:23:59,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:23:59,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:23:59,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1995131069, now seen corresponding path program 1 times [2024-10-24 07:23:59,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:23:59,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292781048] [2024-10-24 07:23:59,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:23:59,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:23:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:23:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:23:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:23:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:23:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:23:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:23:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:23:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:23:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:23:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:23:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:23:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:23:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:23:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:23:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:23:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:23:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:23:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:23:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:23:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:23:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:23:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:23:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:23:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:23:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:23:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:23:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:23:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:23:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:23:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:23:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 07:23:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:23:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:23:59,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:23:59,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292781048] [2024-10-24 07:23:59,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292781048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:23:59,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:23:59,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:23:59,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227100322] [2024-10-24 07:23:59,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:23:59,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:23:59,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:23:59,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:23:59,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:23:59,918 INFO L87 Difference]: Start difference. First operand 171 states and 271 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:23:59,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:23:59,990 INFO L93 Difference]: Finished difference Result 342 states and 543 transitions. [2024-10-24 07:23:59,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:23:59,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-24 07:23:59,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:23:59,993 INFO L225 Difference]: With dead ends: 342 [2024-10-24 07:23:59,993 INFO L226 Difference]: Without dead ends: 172 [2024-10-24 07:23:59,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:23:59,996 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:23:59,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:23:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-24 07:24:00,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-10-24 07:24:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 107 states have (on average 1.3831775700934579) internal successors, (148), 107 states have internal predecessors, (148), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 07:24:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 272 transitions. [2024-10-24 07:24:00,031 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 272 transitions. Word has length 196 [2024-10-24 07:24:00,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:24:00,032 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 272 transitions. [2024-10-24 07:24:00,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 272 transitions. [2024-10-24 07:24:00,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 07:24:00,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:24:00,035 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:24:00,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 07:24:00,035 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:24:00,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:24:00,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1993284027, now seen corresponding path program 1 times [2024-10-24 07:24:00,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:24:00,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263549998] [2024-10-24 07:24:00,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:00,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:24:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:24:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:24:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:24:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:24:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:24:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:24:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:24:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:24:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:24:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:24:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:24:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:24:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:24:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:24:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:24:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:24:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:24:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:24:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:24:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:24:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:24:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:24:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:24:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:24:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:24:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:24:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:24:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:24:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:24:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:24:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 07:24:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:24:00,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:24:00,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263549998] [2024-10-24 07:24:00,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263549998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:24:00,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:24:00,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:24:00,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860897824] [2024-10-24 07:24:00,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:24:00,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:24:00,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:24:00,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:24:00,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:24:00,441 INFO L87 Difference]: Start difference. First operand 172 states and 272 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:00,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:24:00,493 INFO L93 Difference]: Finished difference Result 514 states and 814 transitions. [2024-10-24 07:24:00,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:24:00,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-24 07:24:00,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:24:00,499 INFO L225 Difference]: With dead ends: 514 [2024-10-24 07:24:00,499 INFO L226 Difference]: Without dead ends: 343 [2024-10-24 07:24:00,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:24:00,502 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 74 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 284 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-24 07:24:00,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 284 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:24:00,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-24 07:24:00,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2024-10-24 07:24:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 212 states have (on average 1.3773584905660377) internal successors, (292), 212 states have internal predecessors, (292), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 07:24:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 540 transitions. [2024-10-24 07:24:00,561 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 540 transitions. Word has length 196 [2024-10-24 07:24:00,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:24:00,562 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 540 transitions. [2024-10-24 07:24:00,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 540 transitions. [2024-10-24 07:24:00,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-24 07:24:00,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:24:00,565 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:24:00,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 07:24:00,565 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:24:00,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:24:00,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1408134321, now seen corresponding path program 1 times [2024-10-24 07:24:00,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:24:00,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547113799] [2024-10-24 07:24:00,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:00,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:24:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:24:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:24:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:24:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:24:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:24:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:24:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:24:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:24:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:24:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:24:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:24:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:24:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:24:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:24:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:24:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:24:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:24:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:24:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:24:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:24:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:24:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:24:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:24:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:24:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:24:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:24:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:24:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:24:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:24:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:24:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 07:24:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:24:00,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:24:00,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547113799] [2024-10-24 07:24:00,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547113799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:24:00,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:24:00,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:24:00,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996415152] [2024-10-24 07:24:00,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:24:00,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:24:00,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:24:00,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:24:00,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:24:00,725 INFO L87 Difference]: Start difference. First operand 341 states and 540 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:24:00,770 INFO L93 Difference]: Finished difference Result 809 states and 1258 transitions. [2024-10-24 07:24:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:24:00,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2024-10-24 07:24:00,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:24:00,777 INFO L225 Difference]: With dead ends: 809 [2024-10-24 07:24:00,778 INFO L226 Difference]: Without dead ends: 469 [2024-10-24 07:24:00,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:24:00,781 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 37 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:24:00,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 281 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:24:00,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-24 07:24:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 463. [2024-10-24 07:24:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 322 states have (on average 1.3850931677018634) internal successors, (446), 326 states have internal predecessors, (446), 132 states have call successors, (132), 8 states have call predecessors, (132), 8 states have return successors, (132), 128 states have call predecessors, (132), 132 states have call successors, (132) [2024-10-24 07:24:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 710 transitions. [2024-10-24 07:24:00,833 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 710 transitions. Word has length 197 [2024-10-24 07:24:00,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:24:00,834 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 710 transitions. [2024-10-24 07:24:00,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:00,835 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 710 transitions. [2024-10-24 07:24:00,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-24 07:24:00,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:24:00,837 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:24:00,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 07:24:00,837 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:24:00,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:24:00,838 INFO L85 PathProgramCache]: Analyzing trace with hash 384208526, now seen corresponding path program 1 times [2024-10-24 07:24:00,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:24:00,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687676291] [2024-10-24 07:24:00,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:00,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:24:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:24:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:24:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:24:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:24:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:24:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:24:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:24:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:24:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:24:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:24:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:24:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:24:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:24:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:24:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:24:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:24:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:24:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:24:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:24:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:24:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:24:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:24:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:24:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:24:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:24:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:24:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:24:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:24:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:24:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:24:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 07:24:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:24:01,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:24:01,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687676291] [2024-10-24 07:24:01,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687676291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:24:01,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:24:01,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:24:01,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398063274] [2024-10-24 07:24:01,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:24:01,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:24:01,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:24:01,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:24:01,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:24:01,179 INFO L87 Difference]: Start difference. First operand 463 states and 710 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:01,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:24:01,277 INFO L93 Difference]: Finished difference Result 1267 states and 1932 transitions. [2024-10-24 07:24:01,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:24:01,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2024-10-24 07:24:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:24:01,288 INFO L225 Difference]: With dead ends: 1267 [2024-10-24 07:24:01,288 INFO L226 Difference]: Without dead ends: 805 [2024-10-24 07:24:01,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:24:01,291 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 75 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:24:01,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 260 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:24:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-10-24 07:24:01,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 799. [2024-10-24 07:24:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 590 states have (on average 1.3864406779661016) internal successors, (818), 602 states have internal predecessors, (818), 192 states have call successors, (192), 16 states have call predecessors, (192), 16 states have return successors, (192), 180 states have call predecessors, (192), 192 states have call successors, (192) [2024-10-24 07:24:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1202 transitions. [2024-10-24 07:24:01,376 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1202 transitions. Word has length 197 [2024-10-24 07:24:01,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:24:01,377 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1202 transitions. [2024-10-24 07:24:01,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1202 transitions. [2024-10-24 07:24:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-24 07:24:01,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:24:01,381 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:24:01,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 07:24:01,382 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:24:01,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:24:01,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1421229808, now seen corresponding path program 1 times [2024-10-24 07:24:01,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:24:01,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279396208] [2024-10-24 07:24:01,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:01,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:24:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:24:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 07:24:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 07:24:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:24:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:24:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:24:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:24:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 07:24:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:24:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:24:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:24:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 07:24:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:24:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:24:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:24:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:24:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:24:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:24:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:24:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:24:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:24:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:24:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:24:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:24:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:24:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:24:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:24:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:24:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:24:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:24:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 07:24:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-24 07:24:01,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:24:01,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279396208] [2024-10-24 07:24:01,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279396208] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:24:01,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017493184] [2024-10-24 07:24:01,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:01,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:24:01,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:24:01,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:24:01,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 07:24:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:01,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 07:24:02,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:24:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 688 proven. 69 refuted. 0 times theorem prover too weak. 1103 trivial. 0 not checked. [2024-10-24 07:24:02,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:24:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-24 07:24:02,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017493184] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:24:02,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:24:02,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-10-24 07:24:02,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331122251] [2024-10-24 07:24:02,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:24:02,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 07:24:02,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:24:02,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 07:24:02,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 07:24:02,596 INFO L87 Difference]: Start difference. First operand 799 states and 1202 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-10-24 07:24:02,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:24:02,929 INFO L93 Difference]: Finished difference Result 1645 states and 2443 transitions. [2024-10-24 07:24:02,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 07:24:02,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 197 [2024-10-24 07:24:02,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:24:02,936 INFO L225 Difference]: With dead ends: 1645 [2024-10-24 07:24:02,937 INFO L226 Difference]: Without dead ends: 847 [2024-10-24 07:24:02,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 451 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-24 07:24:02,941 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 122 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:24:02,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 377 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:24:02,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-10-24 07:24:03,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 831. [2024-10-24 07:24:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 614 states have (on average 1.3583061889250814) internal successors, (834), 626 states have internal predecessors, (834), 192 states have call successors, (192), 24 states have call predecessors, (192), 24 states have return successors, (192), 180 states have call predecessors, (192), 192 states have call successors, (192) [2024-10-24 07:24:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1218 transitions. [2024-10-24 07:24:03,018 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1218 transitions. Word has length 197 [2024-10-24 07:24:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:24:03,018 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1218 transitions. [2024-10-24 07:24:03,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-10-24 07:24:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1218 transitions. [2024-10-24 07:24:03,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-24 07:24:03,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:24:03,023 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:24:03,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 07:24:03,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:24:03,224 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:24:03,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:24:03,224 INFO L85 PathProgramCache]: Analyzing trace with hash -146149897, now seen corresponding path program 1 times [2024-10-24 07:24:03,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:24:03,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369012327] [2024-10-24 07:24:03,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:03,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:24:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 07:24:03,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [880188189] [2024-10-24 07:24:03,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:03,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:24:03,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:24:03,376 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:24:03,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 07:24:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:24:03,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 07:24:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:24:03,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 07:24:03,713 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 07:24:03,714 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 07:24:03,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 07:24:03,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-24 07:24:03,920 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:24:04,084 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 07:24:04,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:24:04 BoogieIcfgContainer [2024-10-24 07:24:04,088 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 07:24:04,089 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 07:24:04,089 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 07:24:04,089 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 07:24:04,090 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:23:57" (3/4) ... [2024-10-24 07:24:04,092 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 07:24:04,093 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 07:24:04,093 INFO L158 Benchmark]: Toolchain (without parser) took 7920.61ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 139.1MB in the beginning and 186.0MB in the end (delta: -46.9MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2024-10-24 07:24:04,094 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 127.9MB. Free memory was 89.0MB in the beginning and 88.9MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:24:04,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.52ms. Allocated memory is still 167.8MB. Free memory was 139.1MB in the beginning and 121.9MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 07:24:04,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.08ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 118.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 07:24:04,094 INFO L158 Benchmark]: Boogie Preprocessor took 94.30ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 114.1MB in the end (delta: 4.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 07:24:04,095 INFO L158 Benchmark]: RCFGBuilder took 588.60ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 84.2MB in the end (delta: 29.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-24 07:24:04,095 INFO L158 Benchmark]: TraceAbstraction took 6792.53ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 135.6MB in the beginning and 187.0MB in the end (delta: -51.5MB). Peak memory consumption was 145.8MB. Max. memory is 16.1GB. [2024-10-24 07:24:04,095 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 243.3MB. Free memory was 187.0MB in the beginning and 186.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:24:04,097 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 127.9MB. Free memory was 89.0MB in the beginning and 88.9MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.52ms. Allocated memory is still 167.8MB. Free memory was 139.1MB in the beginning and 121.9MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.08ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 118.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.30ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 114.1MB in the end (delta: 4.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 588.60ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 84.2MB in the end (delta: 29.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6792.53ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 135.6MB in the beginning and 187.0MB in the end (delta: -51.5MB). Peak memory consumption was 145.8MB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 243.3MB. Free memory was 187.0MB in the beginning and 186.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryFLOATComparisonOperation at line 188. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] double var_1_6 = 31.5; [L24] double var_1_9 = 1000000000.25; [L25] float var_1_10 = 1.1; [L26] float var_1_11 = 8.75; [L27] float var_1_12 = 63.8; [L28] unsigned char var_1_13 = 1; [L29] float var_1_14 = 127.5; [L30] signed char var_1_15 = -2; [L31] signed char var_1_16 = 1; [L32] signed char var_1_17 = 1; [L33] signed char var_1_18 = 1; [L34] signed char var_1_19 = -2; [L35] signed char var_1_20 = 16; [L36] signed char var_1_21 = 2; [L37] signed char var_1_22 = 8; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_26 = 0; [L42] unsigned char var_1_27 = 32; [L43] unsigned char var_1_28 = 1; [L44] unsigned long int var_1_33 = 10; [L45] unsigned long int var_1_35 = 2632045268; [L46] signed long int var_1_36 = 32; [L47] unsigned long int var_1_37 = 128; [L48] unsigned long int var_1_39 = 1877460848; [L49] unsigned long int var_1_40 = 1831388024; [L50] unsigned long int var_1_41 = 1967003719; [L51] unsigned char var_1_42 = 0; [L52] unsigned char var_1_46 = 0; [L53] unsigned short int var_1_49 = 0; [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] FCALL updateLastVariables() [L196] CALL updateVariables() [L136] var_1_9 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L137] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L138] var_1_11 = __VERIFIER_nondet_float() [L139] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L139] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L140] var_1_13 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L141] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L142] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L142] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L143] var_1_14 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L144] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L145] var_1_16 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L146] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L147] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L147] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L148] var_1_17 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L149] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L150] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L150] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L151] var_1_19 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L152] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L153] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L153] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L154] var_1_20 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L155] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L156] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L156] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L157] var_1_21 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L158] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L159] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L159] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L160] var_1_22 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_22 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L161] RET assume_abort_if_not(var_1_22 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L162] CALL assume_abort_if_not(var_1_22 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L162] RET assume_abort_if_not(var_1_22 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L163] var_1_24 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L164] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L165] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L165] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L166] var_1_25 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L167] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L168] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L168] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L169] var_1_26 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L170] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L171] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L171] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L172] var_1_35 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_35 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L173] RET assume_abort_if_not(var_1_35 >= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L174] CALL assume_abort_if_not(var_1_35 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L174] RET assume_abort_if_not(var_1_35 <= 4294967294) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L175] var_1_39 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_39 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L176] RET assume_abort_if_not(var_1_39 >= 1073741823) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L177] CALL assume_abort_if_not(var_1_39 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L177] RET assume_abort_if_not(var_1_39 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L178] var_1_40 = __VERIFIER_nondet_ulong() [L179] CALL assume_abort_if_not(var_1_40 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L179] RET assume_abort_if_not(var_1_40 >= 1073741824) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L180] CALL assume_abort_if_not(var_1_40 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L180] RET assume_abort_if_not(var_1_40 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L181] var_1_41 = __VERIFIER_nondet_ulong() [L182] CALL assume_abort_if_not(var_1_41 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L182] RET assume_abort_if_not(var_1_41 >= 1073741824) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L183] CALL assume_abort_if_not(var_1_41 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L183] RET assume_abort_if_not(var_1_41 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L196] RET updateVariables() [L197] CALL step() [L57] var_1_15 = (var_1_16 - var_1_17) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L58] COND FALSE !(var_1_21 > (var_1_27 / var_1_35)) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L61] COND FALSE !((var_1_39 - ((((-50) < 0 ) ? -(-50) : (-50)))) < var_1_27) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L66] var_1_27 = var_1_21 [L67] unsigned char stepLocal_1 = var_1_27; [L68] unsigned char stepLocal_0 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L69] COND TRUE (var_1_27 + var_1_27) <= stepLocal_1 [L70] var_1_1 = (128 + var_1_27) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L78] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L85] COND FALSE !(var_1_27 < (var_1_27 - var_1_27)) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L88] EXPR var_1_27 >> var_1_27 VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L88] COND TRUE var_1_17 >= (var_1_27 >> var_1_27) [L89] COND TRUE var_1_25 || (var_1_20 < var_1_17) [L90] var_1_33 = ((((var_1_35 - var_1_17) < 0 ) ? -(var_1_35 - var_1_17) : (var_1_35 - var_1_17))) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=6442450817, var_1_35=6442450943, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L93] COND TRUE 63.75f <= var_1_11 [L94] var_1_37 = ((var_1_39 + ((((var_1_40) > (var_1_41)) ? (var_1_40) : (var_1_41)))) - ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21)))) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=6442450817, var_1_35=6442450943, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L96] unsigned char stepLocal_2 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=6442450817, var_1_35=6442450943, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L97] COND FALSE !(var_1_27 > stepLocal_2) [L100] var_1_10 = 9.75f VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=1, var_1_19=1, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=6442450817, var_1_35=6442450943, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L102] COND TRUE ((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u [L103] var_1_18 = (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=2, var_1_19=1, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=6442450817, var_1_35=6442450943, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L105] signed long int stepLocal_5 = ~ var_1_21; VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=2, var_1_19=1, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=6442450817, var_1_35=6442450943, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L106] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=2, var_1_19=1, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=6442450817, var_1_35=6442450943, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L115] unsigned char stepLocal_4 = var_1_18 >= var_1_27; [L116] unsigned char stepLocal_3 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=1, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=2, var_1_19=1, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=6442450817, var_1_35=6442450943, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L117] COND FALSE !(var_1_23 && stepLocal_4) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=2, var_1_19=1, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=6442450817, var_1_35=6442450943, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L120] COND TRUE 1 >= stepLocal_3 [L121] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=2, var_1_19=1, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=6442450817, var_1_35=6442450943, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L126] EXPR var_1_21 | (var_1_21 + var_1_21) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=2, var_1_19=1, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=6442450817, var_1_35=6442450943, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L126] COND FALSE !(var_1_27 < (var_1_21 | (var_1_21 + var_1_21))) [L129] COND FALSE !(var_1_41 < ((((var_1_27) < (var_1_21)) ? (var_1_27) : (var_1_21)))) [L132] var_1_42 = (var_1_25 || var_1_25) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=2, var_1_19=1, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=6442450817, var_1_35=6442450943, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L197] RET step() [L198] CALL, EXPR property() [L188-L189] return (((((((((var_1_27 + var_1_27) <= var_1_27) ? (var_1_1 == ((signed short int) (128 + var_1_27))) : ((var_1_27 >= (var_1_27 * var_1_27)) ? (var_1_1 == ((signed short int) var_1_27)) : (var_1_1 == ((signed short int) 1)))) && ((var_1_27 < (var_1_27 - var_1_27)) ? (var_1_6 == ((double) var_1_9)) : 1)) && ((var_1_27 > var_1_27) ? (var_1_10 == ((float) (1.00000000000009E13f - var_1_11))) : (var_1_10 == ((float) 9.75f)))) && ((var_1_23 && (var_1_18 >= var_1_27)) ? (var_1_12 == ((float) var_1_11)) : ((1 >= var_1_27) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_14))))) && (var_1_15 == ((signed char) (var_1_16 - var_1_17)))) && ((((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u) ? (var_1_18 == ((signed char) (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))))) : 1)) && (var_1_13 ? (((~ var_1_21) > var_1_27) ? (var_1_23 == ((unsigned char) (var_1_24 && (! var_1_25)))) : (var_1_24 ? (var_1_23 == ((unsigned char) ((! var_1_25) || var_1_26))) : 1)) : 1)) && (var_1_27 == ((unsigned char) var_1_21)) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=2, var_1_19=1, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=6442450817, var_1_35=6442450943, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L19] reach_error() VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=2, var_1_19=1, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=-1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=6442450817, var_1_35=6442450943, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 9, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 563 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 556 mSDsluCounter, 2213 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1053 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 626 IncrementalHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 1160 mSDtfsCounter, 626 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 951 GetRequests, 932 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=831occurred in iteration=8, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 97 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2164 NumberOfCodeBlocks, 2164 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1955 ConstructedInterpolants, 0 QuantifiedInterpolants, 2833 SizeOfPredicates, 2 NumberOfNonLiveVariables, 448 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 18393/18600 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-24 07:24:04,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bcb802c44fca05d9a0a95a2e14fa4747615929a328e29a7c11119462c0cec4c4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:24:06,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:24:06,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 07:24:06,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:24:06,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:24:06,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:24:06,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:24:06,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:24:06,612 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:24:06,613 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:24:06,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:24:06,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:24:06,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:24:06,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:24:06,617 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:24:06,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:24:06,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:24:06,618 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:24:06,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:24:06,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:24:06,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:24:06,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:24:06,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:24:06,622 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 07:24:06,623 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 07:24:06,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:24:06,623 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 07:24:06,623 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:24:06,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:24:06,623 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:24:06,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:24:06,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:24:06,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:24:06,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:24:06,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:24:06,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:24:06,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:24:06,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:24:06,626 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 07:24:06,627 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 07:24:06,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:24:06,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:24:06,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:24:06,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:24:06,628 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 07:24:06,629 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bcb802c44fca05d9a0a95a2e14fa4747615929a328e29a7c11119462c0cec4c4 [2024-10-24 07:24:06,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:24:06,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:24:06,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:24:06,985 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:24:06,986 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:24:06,988 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-1.i [2024-10-24 07:24:08,574 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:24:08,840 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:24:08,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-1.i [2024-10-24 07:24:08,860 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a46396a81/c5f84719267c4df2a7d4cfc4fca9738d/FLAG38c77d75c [2024-10-24 07:24:09,161 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a46396a81/c5f84719267c4df2a7d4cfc4fca9738d [2024-10-24 07:24:09,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:24:09,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:24:09,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:24:09,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:24:09,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:24:09,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:24:09" (1/1) ... [2024-10-24 07:24:09,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f935776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:09, skipping insertion in model container [2024-10-24 07:24:09,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:24:09" (1/1) ... [2024-10-24 07:24:09,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:24:09,402 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-1.i[918,931] [2024-10-24 07:24:09,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:24:09,528 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:24:09,543 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-1.i[918,931] [2024-10-24 07:24:09,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:24:09,625 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:24:09,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:09 WrapperNode [2024-10-24 07:24:09,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:24:09,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:24:09,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:24:09,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:24:09,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:09" (1/1) ... [2024-10-24 07:24:09,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:09" (1/1) ... [2024-10-24 07:24:09,707 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-10-24 07:24:09,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:24:09,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:24:09,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:24:09,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:24:09,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:09" (1/1) ... [2024-10-24 07:24:09,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:09" (1/1) ... [2024-10-24 07:24:09,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:09" (1/1) ... [2024-10-24 07:24:09,761 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-24 07:24:09,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:09" (1/1) ... [2024-10-24 07:24:09,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:09" (1/1) ... [2024-10-24 07:24:09,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:09" (1/1) ... [2024-10-24 07:24:09,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:09" (1/1) ... [2024-10-24 07:24:09,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:09" (1/1) ... [2024-10-24 07:24:09,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:09" (1/1) ... [2024-10-24 07:24:09,814 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:24:09,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:24:09,815 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:24:09,815 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:24:09,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:09" (1/1) ... [2024-10-24 07:24:09,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:24:09,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:24:09,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 07:24:09,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 07:24:09,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:24:09,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 07:24:09,918 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:24:09,918 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:24:09,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:24:09,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:24:10,044 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:24:10,046 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:24:10,621 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 07:24:10,622 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:24:10,688 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:24:10,688 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:24:10,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:24:10 BoogieIcfgContainer [2024-10-24 07:24:10,689 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:24:10,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:24:10,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:24:10,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:24:10,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:24:09" (1/3) ... [2024-10-24 07:24:10,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29421c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:24:10, skipping insertion in model container [2024-10-24 07:24:10,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:09" (2/3) ... [2024-10-24 07:24:10,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29421c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:24:10, skipping insertion in model container [2024-10-24 07:24:10,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:24:10" (3/3) ... [2024-10-24 07:24:10,704 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-1.i [2024-10-24 07:24:10,721 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:24:10,722 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:24:10,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:24:10,804 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;@436b1986, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:24:10,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:24:10,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 07:24:10,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 07:24:10,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:24:10,825 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:24:10,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:24:10,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:24:10,830 INFO L85 PathProgramCache]: Analyzing trace with hash -442584512, now seen corresponding path program 1 times [2024-10-24 07:24:10,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:24:10,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263034435] [2024-10-24 07:24:10,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:10,845 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-24 07:24:10,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:24:10,849 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:24:10,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 07:24:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:11,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 07:24:11,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:24:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 816 proven. 0 refuted. 0 times theorem prover too weak. 1044 trivial. 0 not checked. [2024-10-24 07:24:11,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:24:11,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:24:11,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263034435] [2024-10-24 07:24:11,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263034435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:24:11,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:24:11,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:24:11,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286346655] [2024-10-24 07:24:11,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:24:11,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:24:11,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:24:11,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:24:11,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:24:11,295 INFO L87 Difference]: Start difference. First operand has 86 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 07:24:11,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:24:11,387 INFO L93 Difference]: Finished difference Result 169 states and 309 transitions. [2024-10-24 07:24:11,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:24:11,393 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 194 [2024-10-24 07:24:11,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:24:11,403 INFO L225 Difference]: With dead ends: 169 [2024-10-24 07:24:11,404 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 07:24:11,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 193 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-24 07:24:11,417 INFO L432 NwaCegarLoop]: 131 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, 131 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-24 07:24:11,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:24:11,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 07:24:11,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 07:24:11,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 07:24:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 134 transitions. [2024-10-24 07:24:11,472 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 134 transitions. Word has length 194 [2024-10-24 07:24:11,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:24:11,473 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 134 transitions. [2024-10-24 07:24:11,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 07:24:11,474 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 134 transitions. [2024-10-24 07:24:11,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 07:24:11,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:24:11,479 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:24:11,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 07:24:11,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:24:11,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:24:11,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:24:11,681 INFO L85 PathProgramCache]: Analyzing trace with hash -665247168, now seen corresponding path program 1 times [2024-10-24 07:24:11,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:24:11,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81052019] [2024-10-24 07:24:11,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:11,683 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-24 07:24:11,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:24:11,686 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:24:11,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 07:24:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:11,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 07:24:11,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:24:12,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 959 proven. 96 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-24 07:24:12,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:24:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:24:12,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:24:12,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81052019] [2024-10-24 07:24:12,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81052019] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 07:24:12,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 07:24:12,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-24 07:24:12,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134777849] [2024-10-24 07:24:12,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:24:12,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:24:12,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:24:12,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:24:12,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:24:12,956 INFO L87 Difference]: Start difference. First operand 84 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:13,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:24:13,086 INFO L93 Difference]: Finished difference Result 167 states and 267 transitions. [2024-10-24 07:24:13,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:24:13,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 194 [2024-10-24 07:24:13,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:24:13,093 INFO L225 Difference]: With dead ends: 167 [2024-10-24 07:24:13,093 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 07:24:13,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:24:13,099 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:24:13,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:24:13,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 07:24:13,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 07:24:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 07:24:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 133 transitions. [2024-10-24 07:24:13,127 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 133 transitions. Word has length 194 [2024-10-24 07:24:13,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:24:13,129 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 133 transitions. [2024-10-24 07:24:13,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:13,130 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 133 transitions. [2024-10-24 07:24:13,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 07:24:13,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:24:13,138 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:24:13,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 07:24:13,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:24:13,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:24:13,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:24:13,340 INFO L85 PathProgramCache]: Analyzing trace with hash 35817410, now seen corresponding path program 1 times [2024-10-24 07:24:13,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:24:13,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239325975] [2024-10-24 07:24:13,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:13,341 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-24 07:24:13,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:24:13,344 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:24:13,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 07:24:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:13,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 07:24:13,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:24:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:24:13,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:24:13,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:24:13,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239325975] [2024-10-24 07:24:13,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239325975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:24:13,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:24:13,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:24:13,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176632338] [2024-10-24 07:24:13,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:24:13,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:24:13,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:24:13,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:24:13,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:24:13,957 INFO L87 Difference]: Start difference. First operand 84 states and 133 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:24:14,073 INFO L93 Difference]: Finished difference Result 250 states and 397 transitions. [2024-10-24 07:24:14,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:24:14,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 194 [2024-10-24 07:24:14,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:24:14,084 INFO L225 Difference]: With dead ends: 250 [2024-10-24 07:24:14,084 INFO L226 Difference]: Without dead ends: 167 [2024-10-24 07:24:14,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:24:14,090 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 32 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:24:14,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 253 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:24:14,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-24 07:24:14,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2024-10-24 07:24:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 07:24:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 263 transitions. [2024-10-24 07:24:14,135 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 263 transitions. Word has length 194 [2024-10-24 07:24:14,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:24:14,136 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 263 transitions. [2024-10-24 07:24:14,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 263 transitions. [2024-10-24 07:24:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-24 07:24:14,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:24:14,141 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:24:14,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 07:24:14,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:24:14,343 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:24:14,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:24:14,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1589827768, now seen corresponding path program 1 times [2024-10-24 07:24:14,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:24:14,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053760040] [2024-10-24 07:24:14,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:14,345 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-24 07:24:14,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:24:14,351 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:24:14,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 07:24:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:14,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 07:24:14,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:24:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1085 proven. 159 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-10-24 07:24:15,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:24:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-24 07:24:15,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:24:15,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053760040] [2024-10-24 07:24:15,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053760040] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:24:15,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 07:24:15,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-10-24 07:24:15,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261793878] [2024-10-24 07:24:15,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 07:24:15,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 07:24:15,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:24:15,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 07:24:15,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-24 07:24:15,998 INFO L87 Difference]: Start difference. First operand 165 states and 263 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 5 states have call successors, (54), 4 states have call predecessors, (54), 7 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2024-10-24 07:24:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:24:17,718 INFO L93 Difference]: Finished difference Result 552 states and 814 transitions. [2024-10-24 07:24:17,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-24 07:24:17,721 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 5 states have call successors, (54), 4 states have call predecessors, (54), 7 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) Word has length 195 [2024-10-24 07:24:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:24:17,729 INFO L225 Difference]: With dead ends: 552 [2024-10-24 07:24:17,729 INFO L226 Difference]: Without dead ends: 388 [2024-10-24 07:24:17,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 376 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=479, Invalid=1243, Unknown=0, NotChecked=0, Total=1722 [2024-10-24 07:24:17,733 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 237 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:24:17,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 375 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 07:24:17,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-24 07:24:17,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 211. [2024-10-24 07:24:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 138 states have (on average 1.318840579710145) internal successors, (182), 138 states have internal predecessors, (182), 62 states have call successors, (62), 10 states have call predecessors, (62), 10 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 07:24:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 306 transitions. [2024-10-24 07:24:17,775 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 306 transitions. Word has length 195 [2024-10-24 07:24:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:24:17,776 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 306 transitions. [2024-10-24 07:24:17,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 5 states have call successors, (54), 4 states have call predecessors, (54), 7 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2024-10-24 07:24:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 306 transitions. [2024-10-24 07:24:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 07:24:17,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:24:17,779 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:24:17,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 07:24:17,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:24:17,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:24:17,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:24:17,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1865667282, now seen corresponding path program 1 times [2024-10-24 07:24:17,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:24:17,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451793171] [2024-10-24 07:24:17,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:17,986 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-24 07:24:17,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:24:17,989 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:24:17,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 07:24:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:18,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 07:24:18,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:24:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 959 proven. 96 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-24 07:24:19,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:24:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:24:19,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:24:19,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451793171] [2024-10-24 07:24:19,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451793171] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 07:24:19,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 07:24:19,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-10-24 07:24:19,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777839568] [2024-10-24 07:24:19,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:24:19,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 07:24:19,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:24:19,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 07:24:19,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-24 07:24:19,496 INFO L87 Difference]: Start difference. First operand 211 states and 306 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:20,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:24:20,277 INFO L93 Difference]: Finished difference Result 843 states and 1211 transitions. [2024-10-24 07:24:20,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 07:24:20,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-24 07:24:20,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:24:20,288 INFO L225 Difference]: With dead ends: 843 [2024-10-24 07:24:20,288 INFO L226 Difference]: Without dead ends: 633 [2024-10-24 07:24:20,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-10-24 07:24:20,292 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 378 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 07:24:20,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 481 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 07:24:20,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-10-24 07:24:20,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 365. [2024-10-24 07:24:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 260 states have (on average 1.376923076923077) internal successors, (358), 262 states have internal predecessors, (358), 88 states have call successors, (88), 16 states have call predecessors, (88), 16 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-24 07:24:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 534 transitions. [2024-10-24 07:24:20,364 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 534 transitions. Word has length 196 [2024-10-24 07:24:20,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:24:20,365 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 534 transitions. [2024-10-24 07:24:20,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 534 transitions. [2024-10-24 07:24:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 07:24:20,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:24:20,368 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:24:20,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-24 07:24:20,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:24:20,572 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:24:20,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:24:20,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1808408980, now seen corresponding path program 1 times [2024-10-24 07:24:20,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:24:20,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200894660] [2024-10-24 07:24:20,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:20,574 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-24 07:24:20,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:24:20,575 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:24:20,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 07:24:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:20,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 07:24:20,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:24:21,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1073 proven. 84 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 07:24:21,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:24:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 207 proven. 54 refuted. 0 times theorem prover too weak. 1599 trivial. 0 not checked. [2024-10-24 07:24:22,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:24:22,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200894660] [2024-10-24 07:24:22,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200894660] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:24:22,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 07:24:22,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2024-10-24 07:24:22,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159131336] [2024-10-24 07:24:22,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 07:24:22,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 07:24:22,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:24:22,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 07:24:22,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2024-10-24 07:24:22,045 INFO L87 Difference]: Start difference. First operand 365 states and 534 transitions. Second operand has 24 states, 23 states have (on average 4.173913043478261) internal successors, (96), 22 states have internal predecessors, (96), 5 states have call successors, (48), 4 states have call predecessors, (48), 9 states have return successors, (49), 7 states have call predecessors, (49), 5 states have call successors, (49) [2024-10-24 07:24:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:24:23,042 INFO L93 Difference]: Finished difference Result 793 states and 1137 transitions. [2024-10-24 07:24:23,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-24 07:24:23,043 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.173913043478261) internal successors, (96), 22 states have internal predecessors, (96), 5 states have call successors, (48), 4 states have call predecessors, (48), 9 states have return successors, (49), 7 states have call predecessors, (49), 5 states have call successors, (49) Word has length 196 [2024-10-24 07:24:23,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:24:23,047 INFO L225 Difference]: With dead ends: 793 [2024-10-24 07:24:23,048 INFO L226 Difference]: Without dead ends: 429 [2024-10-24 07:24:23,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 367 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=415, Invalid=775, Unknown=0, NotChecked=0, Total=1190 [2024-10-24 07:24:23,050 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 219 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 07:24:23,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 289 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 07:24:23,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-24 07:24:23,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 255. [2024-10-24 07:24:23,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 178 states have (on average 1.3146067415730338) internal successors, (234), 178 states have internal predecessors, (234), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 07:24:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 358 transitions. [2024-10-24 07:24:23,084 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 358 transitions. Word has length 196 [2024-10-24 07:24:23,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:24:23,085 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 358 transitions. [2024-10-24 07:24:23,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.173913043478261) internal successors, (96), 22 states have internal predecessors, (96), 5 states have call successors, (48), 4 states have call predecessors, (48), 9 states have return successors, (49), 7 states have call predecessors, (49), 5 states have call successors, (49) [2024-10-24 07:24:23,085 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 358 transitions. [2024-10-24 07:24:23,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 07:24:23,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:24:23,087 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:24:23,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 07:24:23,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:24:23,288 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:24:23,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:24:23,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1808349398, now seen corresponding path program 1 times [2024-10-24 07:24:23,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:24:23,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682389642] [2024-10-24 07:24:23,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:23,290 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-24 07:24:23,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:24:23,292 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:24:23,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 07:24:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:23,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 07:24:23,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:24:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 959 proven. 96 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-24 07:24:24,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:24:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:24:24,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:24:24,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682389642] [2024-10-24 07:24:24,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682389642] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 07:24:24,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 07:24:24,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-10-24 07:24:24,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823403868] [2024-10-24 07:24:24,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:24:24,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:24:24,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:24:24,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:24:24,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-24 07:24:24,461 INFO L87 Difference]: Start difference. First operand 255 states and 358 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:24:24,974 INFO L93 Difference]: Finished difference Result 899 states and 1240 transitions. [2024-10-24 07:24:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 07:24:24,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-24 07:24:24,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:24:24,979 INFO L225 Difference]: With dead ends: 899 [2024-10-24 07:24:24,979 INFO L226 Difference]: Without dead ends: 645 [2024-10-24 07:24:24,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-24 07:24:24,981 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 365 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 07:24:24,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 380 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 07:24:24,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-10-24 07:24:25,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 255. [2024-10-24 07:24:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 178 states have (on average 1.303370786516854) internal successors, (232), 178 states have internal predecessors, (232), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 07:24:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 356 transitions. [2024-10-24 07:24:25,021 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 356 transitions. Word has length 196 [2024-10-24 07:24:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:24:25,022 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 356 transitions. [2024-10-24 07:24:25,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 356 transitions. [2024-10-24 07:24:25,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 07:24:25,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:24:25,025 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:24:25,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 07:24:25,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:24:25,233 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:24:25,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:24:25,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1107284820, now seen corresponding path program 1 times [2024-10-24 07:24:25,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:24:25,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081723351] [2024-10-24 07:24:25,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:25,234 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-24 07:24:25,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:24:25,236 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:24:25,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 07:24:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:25,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 07:24:25,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:24:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 959 proven. 96 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-24 07:24:25,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:24:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:24:25,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:24:25,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081723351] [2024-10-24 07:24:25,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081723351] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 07:24:25,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 07:24:25,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2024-10-24 07:24:25,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678839593] [2024-10-24 07:24:25,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:24:25,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:24:25,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:24:25,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:24:25,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 07:24:25,925 INFO L87 Difference]: Start difference. First operand 255 states and 356 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:26,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:24:26,159 INFO L93 Difference]: Finished difference Result 709 states and 982 transitions. [2024-10-24 07:24:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:24:26,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-24 07:24:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:24:26,164 INFO L225 Difference]: With dead ends: 709 [2024-10-24 07:24:26,165 INFO L226 Difference]: Without dead ends: 435 [2024-10-24 07:24:26,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 07:24:26,167 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 116 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:24:26,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 402 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:24:26,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-10-24 07:24:26,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 255. [2024-10-24 07:24:26,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 178 states have (on average 1.2921348314606742) internal successors, (230), 178 states have internal predecessors, (230), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 07:24:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 354 transitions. [2024-10-24 07:24:26,197 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 354 transitions. Word has length 196 [2024-10-24 07:24:26,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:24:26,199 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 354 transitions. [2024-10-24 07:24:26,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:26,200 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 354 transitions. [2024-10-24 07:24:26,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 07:24:26,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:24:26,201 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:24:26,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 07:24:26,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:24:26,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:24:26,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:24:26,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1646752982, now seen corresponding path program 1 times [2024-10-24 07:24:26,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:24:26,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661072974] [2024-10-24 07:24:26,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:26,403 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-24 07:24:26,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:24:26,404 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:24:26,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 07:24:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:26,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 07:24:26,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:24:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 959 proven. 96 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-24 07:24:26,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:24:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:24:27,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:24:27,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661072974] [2024-10-24 07:24:27,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661072974] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 07:24:27,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 07:24:27,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-10-24 07:24:27,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344538325] [2024-10-24 07:24:27,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:24:27,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 07:24:27,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:24:27,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 07:24:27,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-24 07:24:27,217 INFO L87 Difference]: Start difference. First operand 255 states and 354 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:27,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:24:27,665 INFO L93 Difference]: Finished difference Result 706 states and 968 transitions. [2024-10-24 07:24:27,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 07:24:27,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-24 07:24:27,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:24:27,671 INFO L225 Difference]: With dead ends: 706 [2024-10-24 07:24:27,671 INFO L226 Difference]: Without dead ends: 452 [2024-10-24 07:24:27,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-10-24 07:24:27,675 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 195 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 07:24:27,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 282 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 07:24:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-10-24 07:24:27,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 291. [2024-10-24 07:24:27,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 214 states have (on average 1.3224299065420562) internal successors, (283), 214 states have internal predecessors, (283), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 07:24:27,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 407 transitions. [2024-10-24 07:24:27,718 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 407 transitions. Word has length 196 [2024-10-24 07:24:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:24:27,719 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 407 transitions. [2024-10-24 07:24:27,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:24:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 407 transitions. [2024-10-24 07:24:27,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 07:24:27,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:24:27,721 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:24:27,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-24 07:24:27,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:24:27,922 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:24:27,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:24:27,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1644905940, now seen corresponding path program 1 times [2024-10-24 07:24:27,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:24:27,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442677728] [2024-10-24 07:24:27,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:27,927 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-24 07:24:27,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:24:27,931 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:24:27,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 07:24:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:28,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 07:24:28,151 INFO L278 TraceCheckSpWp]: Computing forward predicates...