./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-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.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 a731dee61f6e8731b14d03c15b42de9f4b4275aad2a5e7d49729c65ca9af6db7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:08:31,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:08:31,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:08:31,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:08:31,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:08:31,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:08:31,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:08:31,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:08:31,368 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:08:31,368 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:08:31,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:08:31,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:08:31,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:08:31,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:08:31,371 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:08:31,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:08:31,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:08:31,372 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:08:31,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:08:31,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:08:31,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:08:31,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:08:31,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:08:31,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:08:31,376 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:08:31,376 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:08:31,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:08:31,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:08:31,377 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:08:31,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:08:31,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:08:31,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:08:31,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:08:31,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:08:31,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:08:31,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:08:31,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:08:31,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:08:31,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:08:31,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:08:31,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:08:31,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:08:31,380 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 -> a731dee61f6e8731b14d03c15b42de9f4b4275aad2a5e7d49729c65ca9af6db7 [2024-10-13 02:08:31,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:08:31,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:08:31,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:08:31,674 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:08:31,674 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:08:31,675 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-32.i [2024-10-13 02:08:33,074 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:08:33,270 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:08:33,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i [2024-10-13 02:08:33,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b4ef078b/f240ea957f9e48bc81a59e7c60a4ba7e/FLAGb580de631 [2024-10-13 02:08:33,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b4ef078b/f240ea957f9e48bc81a59e7c60a4ba7e [2024-10-13 02:08:33,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:08:33,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:08:33,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:08:33,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:08:33,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:08:33,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:08:33" (1/1) ... [2024-10-13 02:08:33,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fcff698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:33, skipping insertion in model container [2024-10-13 02:08:33,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:08:33" (1/1) ... [2024-10-13 02:08:33,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:08:33,587 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-32.i[919,932] [2024-10-13 02:08:33,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:08:33,669 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:08:33,705 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-32.i[919,932] [2024-10-13 02:08:33,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:08:33,768 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:08:33,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:33 WrapperNode [2024-10-13 02:08:33,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:08:33,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:08:33,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:08:33,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:08:33,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:33" (1/1) ... [2024-10-13 02:08:33,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:33" (1/1) ... [2024-10-13 02:08:33,835 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 237 [2024-10-13 02:08:33,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:08:33,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:08:33,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:08:33,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:08:33,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:33" (1/1) ... [2024-10-13 02:08:33,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:33" (1/1) ... [2024-10-13 02:08:33,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:33" (1/1) ... [2024-10-13 02:08:33,866 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:08:33,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:33" (1/1) ... [2024-10-13 02:08:33,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:33" (1/1) ... [2024-10-13 02:08:33,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:33" (1/1) ... [2024-10-13 02:08:33,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:33" (1/1) ... [2024-10-13 02:08:33,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:33" (1/1) ... [2024-10-13 02:08:33,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:33" (1/1) ... [2024-10-13 02:08:33,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:08:33,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:08:33,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:08:33,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:08:33,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:33" (1/1) ... [2024-10-13 02:08:33,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:08:33,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:08:33,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:08:33,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:08:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:08:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:08:33,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:08:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:08:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:08:33,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:08:34,057 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:08:34,060 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:08:34,475 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-13 02:08:34,476 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:08:34,536 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:08:34,538 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:08:34,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:08:34 BoogieIcfgContainer [2024-10-13 02:08:34,539 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:08:34,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:08:34,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:08:34,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:08:34,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:08:33" (1/3) ... [2024-10-13 02:08:34,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae4c217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:08:34, skipping insertion in model container [2024-10-13 02:08:34,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:33" (2/3) ... [2024-10-13 02:08:34,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae4c217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:08:34, skipping insertion in model container [2024-10-13 02:08:34,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:08:34" (3/3) ... [2024-10-13 02:08:34,549 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i [2024-10-13 02:08:34,568 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:08:34,568 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:08:34,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:08:34,647 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;@48d44236, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:08:34,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:08:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 66 states have (on average 1.606060606060606) internal successors, (106), 67 states have internal predecessors, (106), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 02:08:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 02:08:34,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:08:34,690 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:08:34,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:08:34,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:08:34,698 INFO L85 PathProgramCache]: Analyzing trace with hash -772085063, now seen corresponding path program 1 times [2024-10-13 02:08:34,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:08:34,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9277693] [2024-10-13 02:08:34,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:08:34,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:08:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:08:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:08:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:08:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:08:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:08:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:08:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:08:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:08:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:08:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:08:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:08:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:08:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:08:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:08:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:08:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:08:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:08:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:08:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:08:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:08:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:08:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:08:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:08:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 02:08:35,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:08:35,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9277693] [2024-10-13 02:08:35,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9277693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:08:35,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:08:35,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:08:35,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132092994] [2024-10-13 02:08:35,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:08:35,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:08:35,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:08:35,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:08:35,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:08:35,295 INFO L87 Difference]: Start difference. First operand has 92 states, 66 states have (on average 1.606060606060606) internal successors, (106), 67 states have internal predecessors, (106), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 02:08:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:08:35,341 INFO L93 Difference]: Finished difference Result 181 states and 325 transitions. [2024-10-13 02:08:35,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:08:35,345 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2024-10-13 02:08:35,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:08:35,352 INFO L225 Difference]: With dead ends: 181 [2024-10-13 02:08:35,352 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 02:08:35,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:08:35,361 INFO L432 NwaCegarLoop]: 142 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, 142 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:08:35,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:08:35,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 02:08:35,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-13 02:08:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 65 states have (on average 1.523076923076923) internal successors, (99), 65 states have internal predecessors, (99), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 02:08:35,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 145 transitions. [2024-10-13 02:08:35,419 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 145 transitions. Word has length 151 [2024-10-13 02:08:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:08:35,421 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 145 transitions. [2024-10-13 02:08:35,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 02:08:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 145 transitions. [2024-10-13 02:08:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 02:08:35,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:08:35,426 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:08:35,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:08:35,426 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:08:35,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:08:35,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1885236845, now seen corresponding path program 1 times [2024-10-13 02:08:35,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:08:35,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79700691] [2024-10-13 02:08:35,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:08:35,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:08:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:08:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:08:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:08:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:08:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:08:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:08:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:08:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:08:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:08:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:08:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:08:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:08:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:08:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:08:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:08:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:08:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:08:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:08:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:08:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:08:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:08:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:08:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:08:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 02:08:35,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:08:35,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79700691] [2024-10-13 02:08:35,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79700691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:08:35,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:08:35,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:08:35,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358463973] [2024-10-13 02:08:35,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:08:35,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:08:35,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:08:35,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:08:35,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:08:35,798 INFO L87 Difference]: Start difference. First operand 90 states and 145 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 02:08:35,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:08:35,942 INFO L93 Difference]: Finished difference Result 268 states and 433 transitions. [2024-10-13 02:08:35,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:08:35,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2024-10-13 02:08:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:08:35,947 INFO L225 Difference]: With dead ends: 268 [2024-10-13 02:08:35,947 INFO L226 Difference]: Without dead ends: 179 [2024-10-13 02:08:35,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-13 02:08:35,950 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 86 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:08:35,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 253 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:08:35,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-13 02:08:35,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2024-10-13 02:08:35,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 127 states have (on average 1.5039370078740157) internal successors, (191), 127 states have internal predecessors, (191), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-13 02:08:35,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 283 transitions. [2024-10-13 02:08:35,981 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 283 transitions. Word has length 151 [2024-10-13 02:08:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:08:35,982 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 283 transitions. [2024-10-13 02:08:35,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 02:08:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 283 transitions. [2024-10-13 02:08:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 02:08:35,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:08:35,984 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:08:35,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:08:35,984 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:08:35,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:08:35,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1883389803, now seen corresponding path program 1 times [2024-10-13 02:08:35,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:08:35,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107937774] [2024-10-13 02:08:35,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:08:35,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:08:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:08:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:08:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:08:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:08:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:08:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:08:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:08:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:08:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:08:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:08:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:08:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:08:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:08:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:08:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:08:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:08:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:08:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:08:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:08:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:08:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:08:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:08:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:08:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 02:08:36,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:08:36,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107937774] [2024-10-13 02:08:36,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107937774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:08:36,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:08:36,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:08:36,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294853439] [2024-10-13 02:08:36,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:08:36,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:08:36,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:08:36,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:08:36,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:08:36,447 INFO L87 Difference]: Start difference. First operand 176 states and 283 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 02:08:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:08:36,786 INFO L93 Difference]: Finished difference Result 407 states and 649 transitions. [2024-10-13 02:08:36,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:08:36,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2024-10-13 02:08:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:08:36,789 INFO L225 Difference]: With dead ends: 407 [2024-10-13 02:08:36,789 INFO L226 Difference]: Without dead ends: 232 [2024-10-13 02:08:36,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:08:36,791 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 193 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:08:36,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 460 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:08:36,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-13 02:08:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 225. [2024-10-13 02:08:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 173 states have (on average 1.5202312138728324) internal successors, (263), 174 states have internal predecessors, (263), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 02:08:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 359 transitions. [2024-10-13 02:08:36,809 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 359 transitions. Word has length 151 [2024-10-13 02:08:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:08:36,810 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 359 transitions. [2024-10-13 02:08:36,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 02:08:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 359 transitions. [2024-10-13 02:08:36,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 02:08:36,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:08:36,812 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:08:36,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:08:36,812 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:08:36,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:08:36,813 INFO L85 PathProgramCache]: Analyzing trace with hash -309749158, now seen corresponding path program 1 times [2024-10-13 02:08:36,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:08:36,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823020171] [2024-10-13 02:08:36,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:08:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:08:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:08:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:08:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:08:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:08:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:08:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:08:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:08:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:08:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:08:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:08:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:08:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:08:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:08:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:08:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:08:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:08:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:08:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:08:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:08:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:36,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:08:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:08:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:08:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:08:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 02:08:37,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:08:37,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823020171] [2024-10-13 02:08:37,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823020171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:08:37,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:08:37,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:08:37,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505645063] [2024-10-13 02:08:37,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:08:37,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:08:37,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:08:37,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:08:37,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:08:37,020 INFO L87 Difference]: Start difference. First operand 225 states and 359 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 02:08:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:08:37,131 INFO L93 Difference]: Finished difference Result 452 states and 720 transitions. [2024-10-13 02:08:37,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:08:37,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152 [2024-10-13 02:08:37,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:08:37,135 INFO L225 Difference]: With dead ends: 452 [2024-10-13 02:08:37,135 INFO L226 Difference]: Without dead ends: 228 [2024-10-13 02:08:37,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:08:37,137 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 131 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:08:37,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 469 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:08:37,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-13 02:08:37,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2024-10-13 02:08:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 173 states have (on average 1.5144508670520231) internal successors, (262), 174 states have internal predecessors, (262), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 02:08:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 358 transitions. [2024-10-13 02:08:37,157 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 358 transitions. Word has length 152 [2024-10-13 02:08:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:08:37,157 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 358 transitions. [2024-10-13 02:08:37,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 02:08:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 358 transitions. [2024-10-13 02:08:37,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 02:08:37,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:08:37,159 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:08:37,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:08:37,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:08:37,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:08:37,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1272523396, now seen corresponding path program 1 times [2024-10-13 02:08:37,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:08:37,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364877912] [2024-10-13 02:08:37,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:08:37,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:08:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:08:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:08:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:08:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:08:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:08:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:08:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:08:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:08:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:08:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:08:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:08:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:08:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:08:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:08:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:08:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:08:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:08:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:08:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:08:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:08:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:08:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:08:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:08:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 02:08:37,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:08:37,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364877912] [2024-10-13 02:08:37,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364877912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:08:37,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:08:37,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 02:08:37,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982069901] [2024-10-13 02:08:37,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:08:37,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 02:08:37,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:08:37,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 02:08:37,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:08:37,433 INFO L87 Difference]: Start difference. First operand 225 states and 358 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 02:08:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:08:37,604 INFO L93 Difference]: Finished difference Result 582 states and 926 transitions. [2024-10-13 02:08:37,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 02:08:37,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 153 [2024-10-13 02:08:37,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:08:37,608 INFO L225 Difference]: With dead ends: 582 [2024-10-13 02:08:37,608 INFO L226 Difference]: Without dead ends: 358 [2024-10-13 02:08:37,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 02:08:37,609 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 262 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:08:37,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 503 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:08:37,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-13 02:08:37,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 289. [2024-10-13 02:08:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 234 states have (on average 1.547008547008547) internal successors, (362), 236 states have internal predecessors, (362), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 02:08:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 462 transitions. [2024-10-13 02:08:37,628 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 462 transitions. Word has length 153 [2024-10-13 02:08:37,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:08:37,629 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 462 transitions. [2024-10-13 02:08:37,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 02:08:37,629 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 462 transitions. [2024-10-13 02:08:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 02:08:37,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:08:37,631 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:08:37,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 02:08:37,631 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:08:37,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:08:37,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1348914275, now seen corresponding path program 1 times [2024-10-13 02:08:37,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:08:37,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707438706] [2024-10-13 02:08:37,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:08:37,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:08:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:08:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:08:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:08:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:08:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:08:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:08:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:08:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:08:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:08:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:08:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:08:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:08:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:08:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:08:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:08:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:08:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:08:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:08:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:08:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:08:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:08:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:08:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:08:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 02:08:37,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:08:37,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707438706] [2024-10-13 02:08:37,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707438706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:08:37,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:08:37,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 02:08:37,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079640779] [2024-10-13 02:08:37,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:08:37,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 02:08:37,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:08:37,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 02:08:37,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:08:37,876 INFO L87 Difference]: Start difference. First operand 289 states and 462 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 02:08:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:08:38,104 INFO L93 Difference]: Finished difference Result 613 states and 972 transitions. [2024-10-13 02:08:38,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 02:08:38,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 154 [2024-10-13 02:08:38,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:08:38,108 INFO L225 Difference]: With dead ends: 613 [2024-10-13 02:08:38,108 INFO L226 Difference]: Without dead ends: 325 [2024-10-13 02:08:38,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-13 02:08:38,111 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 273 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:08:38,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 523 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:08:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-13 02:08:38,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 293. [2024-10-13 02:08:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 238 states have (on average 1.5546218487394958) internal successors, (370), 240 states have internal predecessors, (370), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 02:08:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 470 transitions. [2024-10-13 02:08:38,142 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 470 transitions. Word has length 154 [2024-10-13 02:08:38,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:08:38,142 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 470 transitions. [2024-10-13 02:08:38,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 02:08:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 470 transitions. [2024-10-13 02:08:38,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 02:08:38,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:08:38,144 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:08:38,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 02:08:38,144 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:08:38,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:08:38,145 INFO L85 PathProgramCache]: Analyzing trace with hash -597428952, now seen corresponding path program 1 times [2024-10-13 02:08:38,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:08:38,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119887624] [2024-10-13 02:08:38,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:08:38,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:08:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:08:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:08:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:08:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:08:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:08:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:08:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:08:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:08:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:08:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:08:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:08:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:08:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:08:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:08:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:08:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:08:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:08:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:08:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:08:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:08:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:08:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:08:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:08:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 02:08:38,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:08:38,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119887624] [2024-10-13 02:08:38,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119887624] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:08:38,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620788582] [2024-10-13 02:08:38,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:08:38,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:08:38,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:08:38,460 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:08:38,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 02:08:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:38,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 02:08:38,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:08:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-10-13 02:08:38,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:08:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 02:08:38,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620788582] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:08:38,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:08:38,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-13 02:08:38,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686325317] [2024-10-13 02:08:38,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:08:38,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 02:08:38,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:08:38,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 02:08:38,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:08:38,937 INFO L87 Difference]: Start difference. First operand 293 states and 470 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-10-13 02:08:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:08:39,248 INFO L93 Difference]: Finished difference Result 646 states and 1006 transitions. [2024-10-13 02:08:39,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 02:08:39,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 154 [2024-10-13 02:08:39,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:08:39,251 INFO L225 Difference]: With dead ends: 646 [2024-10-13 02:08:39,251 INFO L226 Difference]: Without dead ends: 354 [2024-10-13 02:08:39,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 350 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2024-10-13 02:08:39,252 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 254 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:08:39,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 317 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:08:39,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-13 02:08:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 347. [2024-10-13 02:08:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 270 states have (on average 1.4444444444444444) internal successors, (390), 273 states have internal predecessors, (390), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 02:08:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 518 transitions. [2024-10-13 02:08:39,278 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 518 transitions. Word has length 154 [2024-10-13 02:08:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:08:39,278 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 518 transitions. [2024-10-13 02:08:39,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-10-13 02:08:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 518 transitions. [2024-10-13 02:08:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 02:08:39,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:08:39,280 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:08:39,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 02:08:39,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:08:39,482 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:08:39,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:08:39,483 INFO L85 PathProgramCache]: Analyzing trace with hash 676063227, now seen corresponding path program 1 times [2024-10-13 02:08:39,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:08:39,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973427346] [2024-10-13 02:08:39,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:08:39,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:08:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:08:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:08:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:08:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:08:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:08:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:08:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:08:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:08:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:08:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:08:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:08:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:08:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:08:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:08:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:08:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:08:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:08:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:08:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:08:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:08:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:08:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:08:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:08:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:39,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 02:08:39,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:08:39,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973427346] [2024-10-13 02:08:39,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973427346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:08:39,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:08:39,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:08:39,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346403288] [2024-10-13 02:08:39,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:08:39,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:08:39,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:08:39,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:08:39,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:08:39,692 INFO L87 Difference]: Start difference. First operand 347 states and 518 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 02:08:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:08:39,929 INFO L93 Difference]: Finished difference Result 685 states and 1021 transitions. [2024-10-13 02:08:39,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 02:08:39,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2024-10-13 02:08:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:08:39,932 INFO L225 Difference]: With dead ends: 685 [2024-10-13 02:08:39,932 INFO L226 Difference]: Without dead ends: 369 [2024-10-13 02:08:39,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:08:39,934 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 234 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:08:39,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 436 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:08:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-13 02:08:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 343. [2024-10-13 02:08:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 266 states have (on average 1.443609022556391) internal successors, (384), 269 states have internal predecessors, (384), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 02:08:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 512 transitions. [2024-10-13 02:08:39,958 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 512 transitions. Word has length 155 [2024-10-13 02:08:39,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:08:39,958 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 512 transitions. [2024-10-13 02:08:39,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 02:08:39,959 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 512 transitions. [2024-10-13 02:08:39,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 02:08:39,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:08:39,960 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:08:39,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 02:08:39,961 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:08:39,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:08:39,961 INFO L85 PathProgramCache]: Analyzing trace with hash -320785783, now seen corresponding path program 1 times [2024-10-13 02:08:39,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:08:39,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473113779] [2024-10-13 02:08:39,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:08:39,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:08:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:08:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:08:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:08:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:08:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:08:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:08:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:08:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:08:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:08:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:08:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:08:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:08:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:08:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:08:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:08:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:08:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:08:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:08:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:08:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:08:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:08:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:08:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:08:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 02:08:40,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:08:40,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473113779] [2024-10-13 02:08:40,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473113779] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:08:40,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562024130] [2024-10-13 02:08:40,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:08:40,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:08:40,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:08:40,372 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:08:40,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 02:08:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:40,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 02:08:40,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:08:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-10-13 02:08:41,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:08:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 02:08:41,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562024130] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:08:41,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:08:41,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 18 [2024-10-13 02:08:41,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988889273] [2024-10-13 02:08:41,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:08:41,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 02:08:41,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:08:41,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 02:08:41,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-10-13 02:08:41,752 INFO L87 Difference]: Start difference. First operand 343 states and 512 transitions. Second operand has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 5 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-10-13 02:08:42,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:08:42,970 INFO L93 Difference]: Finished difference Result 1196 states and 1728 transitions. [2024-10-13 02:08:42,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-13 02:08:42,971 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 5 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) Word has length 156 [2024-10-13 02:08:42,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:08:42,975 INFO L225 Difference]: With dead ends: 1196 [2024-10-13 02:08:42,975 INFO L226 Difference]: Without dead ends: 884 [2024-10-13 02:08:42,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=637, Invalid=1813, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 02:08:42,978 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1528 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 02:08:42,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 535 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 02:08:42,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2024-10-13 02:08:43,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 668. [2024-10-13 02:08:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 550 states have (on average 1.4745454545454546) internal successors, (811), 555 states have internal predecessors, (811), 93 states have call successors, (93), 24 states have call predecessors, (93), 24 states have return successors, (93), 88 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-13 02:08:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 997 transitions. [2024-10-13 02:08:43,024 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 997 transitions. Word has length 156 [2024-10-13 02:08:43,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:08:43,024 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 997 transitions. [2024-10-13 02:08:43,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 5 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-10-13 02:08:43,024 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 997 transitions. [2024-10-13 02:08:43,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 02:08:43,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:08:43,026 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:08:43,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 02:08:43,226 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-13 02:08:43,227 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:08:43,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:08:43,227 INFO L85 PathProgramCache]: Analyzing trace with hash -320726201, now seen corresponding path program 1 times [2024-10-13 02:08:43,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:08:43,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774635231] [2024-10-13 02:08:43,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:08:43,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:08:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:08:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:08:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:08:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:08:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:08:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:08:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:08:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:08:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:08:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:08:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:08:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:08:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:08:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:08:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:08:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:08:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:08:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:08:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:08:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:08:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:08:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:08:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:08:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2024-10-13 02:08:43,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:08:43,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774635231] [2024-10-13 02:08:43,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774635231] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:08:43,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37402186] [2024-10-13 02:08:43,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:08:43,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:08:43,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:08:43,973 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:08:43,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 02:08:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:44,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 02:08:44,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:08:45,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 669 proven. 135 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-13 02:08:45,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:08:48,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37402186] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:08:48,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:08:48,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 22 [2024-10-13 02:08:48,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409141181] [2024-10-13 02:08:48,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:08:48,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 02:08:48,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:08:48,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 02:08:48,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2024-10-13 02:08:48,102 INFO L87 Difference]: Start difference. First operand 668 states and 997 transitions. Second operand has 22 states, 22 states have (on average 4.363636363636363) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (46), 9 states have call predecessors, (46), 9 states have call successors, (46) [2024-10-13 02:08:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:08:48,943 INFO L93 Difference]: Finished difference Result 910 states and 1319 transitions. [2024-10-13 02:08:48,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-13 02:08:48,944 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.363636363636363) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (46), 9 states have call predecessors, (46), 9 states have call successors, (46) Word has length 156 [2024-10-13 02:08:48,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:08:48,947 INFO L225 Difference]: With dead ends: 910 [2024-10-13 02:08:48,948 INFO L226 Difference]: Without dead ends: 277 [2024-10-13 02:08:48,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=343, Invalid=917, Unknown=0, NotChecked=0, Total=1260 [2024-10-13 02:08:48,950 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 529 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 02:08:48,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 529 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 02:08:48,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-13 02:08:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 245. [2024-10-13 02:08:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 190 states have (on average 1.3368421052631578) internal successors, (254), 192 states have internal predecessors, (254), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 02:08:48,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 332 transitions. [2024-10-13 02:08:48,970 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 332 transitions. Word has length 156 [2024-10-13 02:08:48,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:08:48,972 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 332 transitions. [2024-10-13 02:08:48,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.363636363636363) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (46), 9 states have call predecessors, (46), 9 states have call successors, (46) [2024-10-13 02:08:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 332 transitions. [2024-10-13 02:08:48,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 02:08:48,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:08:48,975 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:08:48,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 02:08:49,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:08:49,179 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:08:49,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:08:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1909074103, now seen corresponding path program 1 times [2024-10-13 02:08:49,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:08:49,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940350079] [2024-10-13 02:08:49,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:08:49,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:08:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:08:49,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:08:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:08:49,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:08:49,328 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:08:49,328 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:08:49,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 02:08:49,332 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:08:49,420 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:08:49,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:08:49 BoogieIcfgContainer [2024-10-13 02:08:49,422 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:08:49,423 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:08:49,423 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:08:49,423 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:08:49,423 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:08:34" (3/4) ... [2024-10-13 02:08:49,425 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:08:49,427 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:08:49,427 INFO L158 Benchmark]: Toolchain (without parser) took 16124.13ms. Allocated memory was 138.4MB in the beginning and 346.0MB in the end (delta: 207.6MB). Free memory was 67.2MB in the beginning and 161.8MB in the end (delta: -94.6MB). Peak memory consumption was 115.9MB. Max. memory is 16.1GB. [2024-10-13 02:08:49,427 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory was 100.4MB in the beginning and 100.2MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:08:49,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.77ms. Allocated memory was 138.4MB in the beginning and 180.4MB in the end (delta: 41.9MB). Free memory was 67.1MB in the beginning and 148.5MB in the end (delta: -81.5MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2024-10-13 02:08:49,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.41ms. Allocated memory is still 180.4MB. Free memory was 148.5MB in the beginning and 143.2MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 02:08:49,428 INFO L158 Benchmark]: Boogie Preprocessor took 61.01ms. Allocated memory is still 180.4MB. Free memory was 143.2MB in the beginning and 137.8MB in the end (delta: 5.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 02:08:49,428 INFO L158 Benchmark]: RCFGBuilder took 640.51ms. Allocated memory is still 180.4MB. Free memory was 137.8MB in the beginning and 102.4MB in the end (delta: 35.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-13 02:08:49,429 INFO L158 Benchmark]: TraceAbstraction took 14880.32ms. Allocated memory was 180.4MB in the beginning and 346.0MB in the end (delta: 165.7MB). Free memory was 102.2MB in the beginning and 161.8MB in the end (delta: -59.7MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. [2024-10-13 02:08:49,429 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 346.0MB. Free memory is still 161.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:08:49,430 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.14ms. Allocated memory is still 138.4MB. Free memory was 100.4MB in the beginning and 100.2MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 465.77ms. Allocated memory was 138.4MB in the beginning and 180.4MB in the end (delta: 41.9MB). Free memory was 67.1MB in the beginning and 148.5MB in the end (delta: -81.5MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.41ms. Allocated memory is still 180.4MB. Free memory was 148.5MB in the beginning and 143.2MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.01ms. Allocated memory is still 180.4MB. Free memory was 143.2MB in the beginning and 137.8MB in the end (delta: 5.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 640.51ms. Allocated memory is still 180.4MB. Free memory was 137.8MB in the beginning and 102.4MB in the end (delta: 35.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14880.32ms. Allocated memory was 180.4MB in the beginning and 346.0MB in the end (delta: 165.7MB). Free memory was 102.2MB in the beginning and 161.8MB in the end (delta: -59.7MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 346.0MB. Free memory is still 161.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryArithmeticFLOAToperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_4 = 100; [L24] unsigned char var_1_5 = 2; [L25] unsigned char var_1_6 = 64; [L26] unsigned char var_1_7 = 32; [L27] unsigned char var_1_8 = 32; [L28] float var_1_9 = 100.5; [L29] float var_1_11 = 0.8; [L30] float var_1_12 = 2.5; [L31] signed short int var_1_13 = -32; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] float var_1_18 = 0.25; [L36] float var_1_19 = 100000000.25; [L37] signed char var_1_20 = 0; [L38] signed char var_1_21 = 10; [L39] double var_1_22 = 1000000.5; [L40] unsigned long int var_1_23 = 256; [L41] unsigned long int var_1_24 = 50; [L42] signed long int var_1_25 = 64; [L43] unsigned long int var_1_32 = 2219578776; [L44] unsigned char var_1_34 = 0; [L45] unsigned char var_1_36 = 5; [L46] unsigned char var_1_41 = 32; [L47] double var_1_42 = 16.125; [L48] double var_1_43 = 256.5; [L49] signed short int var_1_45 = -10; [L50] unsigned char last_1_var_1_1 = 2; [L51] unsigned char last_1_var_1_15 = 1; [L52] signed char last_1_var_1_20 = 0; [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L177] last_1_var_1_1 = var_1_1 [L178] last_1_var_1_15 = var_1_15 [L179] last_1_var_1_20 = var_1_20 [L189] RET updateLastVariables() [L190] CALL updateVariables() [L139] var_1_4 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L140] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L141] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L141] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L142] var_1_5 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L143] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L144] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L144] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L145] var_1_6 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L146] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L147] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L147] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L148] var_1_7 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_8=32, var_1_9=201/2] [L149] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_8=32, var_1_9=201/2] [L150] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=32, var_1_9=201/2] [L150] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=32, var_1_9=201/2] [L151] var_1_8 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_9=201/2] [L152] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_9=201/2] [L153] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L153] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L154] var_1_11 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L155] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L156] var_1_12 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L157] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L158] var_1_16 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L159] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L160] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L160] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L161] var_1_17 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L162] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L163] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L163] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L164] var_1_19 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L165] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L166] var_1_21 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L167] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L168] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L168] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L169] var_1_32 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_32 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L170] RET assume_abort_if_not(var_1_32 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L171] CALL assume_abort_if_not(var_1_32 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L171] RET assume_abort_if_not(var_1_32 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L172] var_1_42 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L173] RET assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L174] CALL assume_abort_if_not(var_1_42 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L174] RET assume_abort_if_not(var_1_42 != 0.0F) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L190] RET updateVariables() [L191] CALL step() [L56] COND FALSE !(var_1_5 >= var_1_6) [L65] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L67] unsigned char stepLocal_1 = var_1_15; [L68] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=-255, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L69] COND TRUE var_1_17 || stepLocal_0 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L70] COND TRUE var_1_15 && stepLocal_1 [L71] var_1_18 = (var_1_11 + var_1_19) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L76] EXPR var_1_13 >> var_1_5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L76] EXPR ((var_1_6) < ((var_1_13 >> var_1_5))) ? (var_1_6) : ((var_1_13 >> var_1_5)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L76] EXPR var_1_13 >> var_1_5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L76] EXPR ((var_1_6) < ((var_1_13 >> var_1_5))) ? (var_1_6) : ((var_1_13 >> var_1_5)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L76] COND FALSE !(var_1_6 < ((((var_1_6) < ((var_1_13 >> var_1_5))) ? (var_1_6) : ((var_1_13 >> var_1_5))))) [L85] COND FALSE !((var_1_5 - var_1_6) <= (~ (var_1_32 - var_1_8))) [L88] var_1_25 = -32 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L91] COND FALSE !((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L100] COND TRUE (var_1_11 / ((((var_1_42) > (256.5)) ? (var_1_42) : (256.5)))) < var_1_12 [L101] var_1_41 = var_1_5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L103] COND TRUE var_1_11 == var_1_18 [L104] var_1_20 = ((var_1_5 + var_1_21) + var_1_8) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L106] COND TRUE var_1_8 >= -25 [L107] var_1_34 = var_1_16 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L109] COND TRUE (var_1_11 - var_1_12) >= (var_1_19 * var_1_12) [L110] var_1_36 = 5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L112] COND FALSE !((((((var_1_19) < (var_1_11)) ? (var_1_19) : (var_1_11))) >= (var_1_12 / var_1_42)) || var_1_16) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L117] EXPR var_1_1 & var_1_7 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L117] EXPR var_1_4 ^ (var_1_1 & var_1_7) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L117] COND TRUE var_1_5 <= (var_1_4 ^ (var_1_1 & var_1_7)) [L118] COND FALSE !(\read(var_1_16)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L126] COND FALSE !(-32 < var_1_13) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L129] COND FALSE !((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) [L132] var_1_9 = var_1_12 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=4294967300, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=4294967300] [L134] var_1_22 = var_1_12 [L135] var_1_23 = var_1_8 [L136] var_1_24 = var_1_6 [L191] RET step() [L192] CALL, EXPR property() [L182-L183] return (((((((((-32 < var_1_13) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) ? ((var_1_6 <= var_1_8) ? (var_1_15 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((last_1_var_1_1 <= last_1_var_1_20) ? (var_1_15 == ((unsigned char) var_1_16)) : ((last_1_var_1_15 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_15) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=4294967300, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=4294967300, var_1_23=0, var_1_24=64, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=4294967300] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=4294967300, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=4294967300, var_1_23=0, var_1_24=64, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=4294967300] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.7s, OverallIterations: 11, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3503 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3490 mSDsluCounter, 4167 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2965 mSDsCounter, 406 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2745 IncrementalHoareTripleChecker+Invalid, 3151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 406 mSolverCounterUnsat, 1202 mSDtfsCounter, 2745 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1429 GetRequests, 1299 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=668occurred in iteration=9, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 395 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 2155 NumberOfCodeBlocks, 2155 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2294 ConstructedInterpolants, 0 QuantifiedInterpolants, 10849 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1132 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 14679/15180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 02:08:49,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-32.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 a731dee61f6e8731b14d03c15b42de9f4b4275aad2a5e7d49729c65ca9af6db7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:08:51,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:08:51,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:08:51,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:08:51,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:08:51,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:08:51,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:08:51,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:08:51,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:08:51,705 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:08:51,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:08:51,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:08:51,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:08:51,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:08:51,707 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:08:51,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:08:51,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:08:51,707 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:08:51,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:08:51,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:08:51,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:08:51,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:08:51,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:08:51,710 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:08:51,710 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:08:51,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:08:51,711 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:08:51,711 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:08:51,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:08:51,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:08:51,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:08:51,712 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:08:51,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:08:51,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:08:51,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:08:51,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:08:51,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:08:51,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:08:51,713 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:08:51,714 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:08:51,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:08:51,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:08:51,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:08:51,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:08:51,715 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:08:51,715 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 -> a731dee61f6e8731b14d03c15b42de9f4b4275aad2a5e7d49729c65ca9af6db7 [2024-10-13 02:08:51,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:08:51,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:08:51,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:08:51,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:08:51,996 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:08:51,998 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-32.i [2024-10-13 02:08:53,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:08:53,615 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:08:53,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i [2024-10-13 02:08:53,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b6f2ba16/adc0f76967fe4129ba4f1abd904f592a/FLAGffaa2502c [2024-10-13 02:08:54,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b6f2ba16/adc0f76967fe4129ba4f1abd904f592a [2024-10-13 02:08:54,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:08:54,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:08:54,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:08:54,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:08:54,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:08:54,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:08:54" (1/1) ... [2024-10-13 02:08:54,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b74548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:54, skipping insertion in model container [2024-10-13 02:08:54,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:08:54" (1/1) ... [2024-10-13 02:08:54,056 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:08:54,215 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-32.i[919,932] [2024-10-13 02:08:54,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:08:54,315 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:08:54,326 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-32.i[919,932] [2024-10-13 02:08:54,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:08:54,363 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:08:54,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:54 WrapperNode [2024-10-13 02:08:54,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:08:54,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:08:54,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:08:54,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:08:54,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:54" (1/1) ... [2024-10-13 02:08:54,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:54" (1/1) ... [2024-10-13 02:08:54,418 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-10-13 02:08:54,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:08:54,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:08:54,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:08:54,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:08:54,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:54" (1/1) ... [2024-10-13 02:08:54,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:54" (1/1) ... [2024-10-13 02:08:54,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:54" (1/1) ... [2024-10-13 02:08:54,460 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:08:54,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:54" (1/1) ... [2024-10-13 02:08:54,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:54" (1/1) ... [2024-10-13 02:08:54,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:54" (1/1) ... [2024-10-13 02:08:54,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:54" (1/1) ... [2024-10-13 02:08:54,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:54" (1/1) ... [2024-10-13 02:08:54,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:54" (1/1) ... [2024-10-13 02:08:54,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:08:54,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:08:54,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:08:54,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:08:54,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:54" (1/1) ... [2024-10-13 02:08:54,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:08:54,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:08:54,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:08:54,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:08:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:08:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:08:54,573 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:08:54,573 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:08:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:08:54,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:08:54,669 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:08:54,671 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:09:18,123 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 02:09:18,124 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:09:18,162 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:09:18,162 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:09:18,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:09:18 BoogieIcfgContainer [2024-10-13 02:09:18,163 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:09:18,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:09:18,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:09:18,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:09:18,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:08:54" (1/3) ... [2024-10-13 02:09:18,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726f49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:09:18, skipping insertion in model container [2024-10-13 02:09:18,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:08:54" (2/3) ... [2024-10-13 02:09:18,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726f49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:09:18, skipping insertion in model container [2024-10-13 02:09:18,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:09:18" (3/3) ... [2024-10-13 02:09:18,169 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i [2024-10-13 02:09:18,182 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:09:18,183 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:09:18,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:09:18,258 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;@7b7e9f5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:09:18,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:09:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 48 states have internal predecessors, (75), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 02:09:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 02:09:18,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:09:18,277 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:09:18,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:09:18,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:09:18,283 INFO L85 PathProgramCache]: Analyzing trace with hash -528789016, now seen corresponding path program 1 times [2024-10-13 02:09:18,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:09:18,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812541204] [2024-10-13 02:09:18,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:09:18,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:09:18,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:09:18,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:09:18,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 02:09:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:09:19,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:09:19,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:09:19,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-10-13 02:09:19,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:09:19,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:09:19,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812541204] [2024-10-13 02:09:19,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812541204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:09:19,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:09:19,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:09:19,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117104811] [2024-10-13 02:09:19,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:09:19,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:09:19,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:09:19,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:09:19,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:09:19,981 INFO L87 Difference]: Start difference. First operand has 73 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 48 states have internal predecessors, (75), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 02:09:22,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:09:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:09:22,722 INFO L93 Difference]: Finished difference Result 141 states and 259 transitions. [2024-10-13 02:09:22,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:09:22,750 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2024-10-13 02:09:22,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:09:22,755 INFO L225 Difference]: With dead ends: 141 [2024-10-13 02:09:22,756 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 02:09:22,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:09:22,760 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 02:09:22,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 02:09:22,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 02:09:22,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-13 02:09:22,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 44 states have internal predecessors, (64), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 02:09:22,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 110 transitions. [2024-10-13 02:09:22,815 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 110 transitions. Word has length 147 [2024-10-13 02:09:22,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:09:22,819 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 110 transitions. [2024-10-13 02:09:22,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 02:09:22,820 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 110 transitions. [2024-10-13 02:09:22,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 02:09:22,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:09:22,823 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:09:22,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 02:09:23,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:09:23,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:09:23,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:09:23,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1154434782, now seen corresponding path program 1 times [2024-10-13 02:09:23,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:09:23,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595557838] [2024-10-13 02:09:23,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:09:23,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:09:23,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:09:23,032 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:09:23,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 02:09:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:09:24,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 02:09:24,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:09:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 508 proven. 42 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2024-10-13 02:09:29,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:09:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 02:09:34,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:09:34,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595557838] [2024-10-13 02:09:34,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595557838] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:09:34,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:09:34,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2024-10-13 02:09:34,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458585454] [2024-10-13 02:09:34,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:09:34,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 02:09:34,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:09:34,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 02:09:34,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-13 02:09:34,020 INFO L87 Difference]: Start difference. First operand 69 states and 110 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-10-13 02:09:45,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:09:47,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:09:50,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:09:58,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:09:58,714 INFO L93 Difference]: Finished difference Result 328 states and 500 transitions. [2024-10-13 02:09:58,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-13 02:09:58,715 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 147 [2024-10-13 02:09:58,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:09:58,718 INFO L225 Difference]: With dead ends: 328 [2024-10-13 02:09:58,721 INFO L226 Difference]: Without dead ends: 260 [2024-10-13 02:09:58,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2024-10-13 02:09:58,727 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 292 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:09:58,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 585 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 19.1s Time] [2024-10-13 02:09:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-13 02:09:58,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 247. [2024-10-13 02:09:58,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 154 states have (on average 1.3311688311688312) internal successors, (205), 155 states have internal predecessors, (205), 83 states have call successors, (83), 9 states have call predecessors, (83), 9 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2024-10-13 02:09:58,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 371 transitions. [2024-10-13 02:09:58,851 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 371 transitions. Word has length 147 [2024-10-13 02:09:58,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:09:58,852 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 371 transitions. [2024-10-13 02:09:58,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-10-13 02:09:58,852 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 371 transitions. [2024-10-13 02:09:58,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 02:09:58,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:09:58,854 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:09:58,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 02:09:59,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:09:59,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:09:59,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:09:59,060 INFO L85 PathProgramCache]: Analyzing trace with hash 127595486, now seen corresponding path program 1 times [2024-10-13 02:09:59,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:09:59,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32541593] [2024-10-13 02:09:59,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:09:59,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:09:59,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:09:59,063 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:09:59,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 02:10:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:10:00,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 02:10:00,612 INFO L278 TraceCheckSpWp]: Computing forward predicates...