./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d9e59086f90a4b77881e2a736ae7adfe917141d6ec019c4e22eac9e57a2e90b4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:05:21,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:05:21,936 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:05:21,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:05:21,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:05:21,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:05:21,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:05:21,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:05:21,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:05:21,965 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:05:21,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:05:21,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:05:21,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:05:21,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:05:21,967 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:05:21,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:05:21,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:05:21,967 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:05:21,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:05:21,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:05:21,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:05:21,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:05:21,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:05:21,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:05:21,971 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:05:21,971 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:05:21,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:05:21,971 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:05:21,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:05:21,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:05:21,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:05:21,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:05:21,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:05:21,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:05:21,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:05:21,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:05:21,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:05:21,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:05:21,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:05:21,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:05:21,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:05:21,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:05:21,975 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d9e59086f90a4b77881e2a736ae7adfe917141d6ec019c4e22eac9e57a2e90b4 [2024-10-11 08:05:22,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:05:22,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:05:22,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:05:22,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:05:22,183 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:05:22,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i [2024-10-11 08:05:23,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:05:23,574 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:05:23,574 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i [2024-10-11 08:05:23,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/411573f43/8a64628ec8f343d8943f432f5505a1f8/FLAG45e025d23 [2024-10-11 08:05:23,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/411573f43/8a64628ec8f343d8943f432f5505a1f8 [2024-10-11 08:05:23,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:05:23,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:05:23,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:05:23,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:05:23,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:05:23,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:05:23" (1/1) ... [2024-10-11 08:05:23,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d32c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:23, skipping insertion in model container [2024-10-11 08:05:23,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:05:23" (1/1) ... [2024-10-11 08:05:23,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:05:23,766 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i[915,928] [2024-10-11 08:05:23,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:05:23,843 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:05:23,851 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i[915,928] [2024-10-11 08:05:23,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:05:23,889 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:05:23,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:23 WrapperNode [2024-10-11 08:05:23,890 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:05:23,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:05:23,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:05:23,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:05:23,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:23" (1/1) ... [2024-10-11 08:05:23,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:23" (1/1) ... [2024-10-11 08:05:23,937 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-10-11 08:05:23,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:05:23,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:05:23,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:05:23,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:05:23,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:23" (1/1) ... [2024-10-11 08:05:23,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:23" (1/1) ... [2024-10-11 08:05:23,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:23" (1/1) ... [2024-10-11 08:05:23,971 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 08:05:23,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:23" (1/1) ... [2024-10-11 08:05:23,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:23" (1/1) ... [2024-10-11 08:05:23,995 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:23" (1/1) ... [2024-10-11 08:05:24,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:23" (1/1) ... [2024-10-11 08:05:24,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:23" (1/1) ... [2024-10-11 08:05:24,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:23" (1/1) ... [2024-10-11 08:05:24,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:05:24,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:05:24,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:05:24,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:05:24,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:23" (1/1) ... [2024-10-11 08:05:24,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:05:24,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:05:24,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:05:24,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:05:24,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:05:24,091 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:05:24,091 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:05:24,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:05:24,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:05:24,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:05:24,160 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:05:24,161 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:05:24,416 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-11 08:05:24,417 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:05:24,461 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:05:24,461 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:05:24,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:05:24 BoogieIcfgContainer [2024-10-11 08:05:24,462 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:05:24,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:05:24,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:05:24,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:05:24,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:05:23" (1/3) ... [2024-10-11 08:05:24,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f2c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:05:24, skipping insertion in model container [2024-10-11 08:05:24,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:23" (2/3) ... [2024-10-11 08:05:24,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f2c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:05:24, skipping insertion in model container [2024-10-11 08:05:24,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:05:24" (3/3) ... [2024-10-11 08:05:24,469 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-42.i [2024-10-11 08:05:24,481 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:05:24,482 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:05:24,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:05:24,541 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;@13aa3649, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:05:24,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:05:24,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 08:05:24,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 08:05:24,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:05:24,555 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:05:24,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:05:24,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:05:24,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1222634115, now seen corresponding path program 1 times [2024-10-11 08:05:24,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:05:24,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626405657] [2024-10-11 08:05:24,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:24,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:05:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:05:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:05:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:05:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:05:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:05:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:05:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:05:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:05:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:05:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:05:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:05:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:05:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:05:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:05:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:05:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:05:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:05:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:05:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:05:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 08:05:24,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:05:24,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626405657] [2024-10-11 08:05:24,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626405657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:05:24,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:05:24,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:05:24,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562861423] [2024-10-11 08:05:24,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:05:24,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:05:24,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:05:24,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:05:24,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:05:24,916 INFO L87 Difference]: Start difference. First operand has 65 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 08:05:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:05:24,952 INFO L93 Difference]: Finished difference Result 127 states and 219 transitions. [2024-10-11 08:05:24,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:05:24,956 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2024-10-11 08:05:24,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:05:24,986 INFO L225 Difference]: With dead ends: 127 [2024-10-11 08:05:24,987 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 08:05:24,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:05:24,993 INFO L432 NwaCegarLoop]: 93 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, 93 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:05:24,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:05:25,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 08:05:25,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-11 08:05:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 08:05:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 96 transitions. [2024-10-11 08:05:25,054 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 96 transitions. Word has length 126 [2024-10-11 08:05:25,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:05:25,055 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 96 transitions. [2024-10-11 08:05:25,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 08:05:25,055 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 96 transitions. [2024-10-11 08:05:25,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 08:05:25,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:05:25,058 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:05:25,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:05:25,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:05:25,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:05:25,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1145517445, now seen corresponding path program 1 times [2024-10-11 08:05:25,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:05:25,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121811476] [2024-10-11 08:05:25,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:25,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:05:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:05:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:05:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:05:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:05:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:05:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:05:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:05:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:05:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:05:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:05:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:05:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:05:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:05:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:05:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:05:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:05:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:05:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:05:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:05:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 08:05:25,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:05:25,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121811476] [2024-10-11 08:05:25,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121811476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:05:25,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:05:25,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:05:25,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515944217] [2024-10-11 08:05:25,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:05:25,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:05:25,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:05:25,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:05:25,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:05:25,456 INFO L87 Difference]: Start difference. First operand 63 states and 96 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 08:05:25,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:05:25,577 INFO L93 Difference]: Finished difference Result 188 states and 287 transitions. [2024-10-11 08:05:25,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:05:25,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2024-10-11 08:05:25,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:05:25,582 INFO L225 Difference]: With dead ends: 188 [2024-10-11 08:05:25,582 INFO L226 Difference]: Without dead ends: 126 [2024-10-11 08:05:25,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:05:25,584 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 88 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:05:25,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 273 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:05:25,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-11 08:05:25,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2024-10-11 08:05:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 08:05:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 161 transitions. [2024-10-11 08:05:25,612 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 161 transitions. Word has length 126 [2024-10-11 08:05:25,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:05:25,613 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 161 transitions. [2024-10-11 08:05:25,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 08:05:25,613 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 161 transitions. [2024-10-11 08:05:25,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 08:05:25,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:05:25,615 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:05:25,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:05:25,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:05:25,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:05:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1340512135, now seen corresponding path program 1 times [2024-10-11 08:05:25,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:05:25,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643221906] [2024-10-11 08:05:25,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:25,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:05:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:05:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:05:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:05:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:05:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:05:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:05:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:05:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:05:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:05:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:05:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:05:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:05:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:05:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:05:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:05:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:05:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:05:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:05:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:05:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:25,858 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 08:05:25,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:05:25,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643221906] [2024-10-11 08:05:25,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643221906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:05:25,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:05:25,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:05:25,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868103279] [2024-10-11 08:05:25,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:05:25,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:05:25,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:05:25,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:05:25,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:05:25,862 INFO L87 Difference]: Start difference. First operand 106 states and 161 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 08:05:25,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:05:25,896 INFO L93 Difference]: Finished difference Result 168 states and 256 transitions. [2024-10-11 08:05:25,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:05:25,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 127 [2024-10-11 08:05:25,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:05:25,903 INFO L225 Difference]: With dead ends: 168 [2024-10-11 08:05:25,904 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 08:05:25,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:05:25,906 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:05:25,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:05:25,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 08:05:25,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-11 08:05:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 65 states have internal predecessors, (84), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 08:05:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 160 transitions. [2024-10-11 08:05:25,920 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 160 transitions. Word has length 127 [2024-10-11 08:05:25,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:05:25,920 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 160 transitions. [2024-10-11 08:05:25,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 08:05:25,920 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 160 transitions. [2024-10-11 08:05:25,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 08:05:25,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:05:25,922 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:05:25,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:05:25,922 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:05:25,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:05:25,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2145108535, now seen corresponding path program 1 times [2024-10-11 08:05:25,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:05:25,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927282085] [2024-10-11 08:05:25,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:25,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:05:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:05:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:05:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:05:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:05:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:05:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:05:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:05:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:05:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:05:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:05:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:05:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:05:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:05:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:05:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:05:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:05:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:05:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:05:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:05:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 51 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2024-10-11 08:05:26,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:05:26,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927282085] [2024-10-11 08:05:26,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927282085] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:05:26,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899571948] [2024-10-11 08:05:26,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:26,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:05:26,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:05:26,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:05:26,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 08:05:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:26,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 08:05:26,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:05:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 443 proven. 51 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 08:05:26,933 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:05:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 54 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-10-11 08:05:27,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899571948] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:05:27,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:05:27,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-10-11 08:05:27,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453460142] [2024-10-11 08:05:27,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:05:27,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 08:05:27,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:05:27,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 08:05:27,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-11 08:05:27,237 INFO L87 Difference]: Start difference. First operand 106 states and 160 transitions. Second operand has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 3 states have call successors, (30), 3 states have call predecessors, (30), 7 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-10-11 08:05:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:05:27,963 INFO L93 Difference]: Finished difference Result 347 states and 488 transitions. [2024-10-11 08:05:27,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-11 08:05:27,964 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 3 states have call successors, (30), 3 states have call predecessors, (30), 7 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 127 [2024-10-11 08:05:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:05:27,967 INFO L225 Difference]: With dead ends: 347 [2024-10-11 08:05:27,967 INFO L226 Difference]: Without dead ends: 285 [2024-10-11 08:05:27,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 08:05:27,969 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 346 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:05:27,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 459 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:05:27,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-11 08:05:27,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 189. [2024-10-11 08:05:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 122 states have internal predecessors, (154), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-11 08:05:28,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 268 transitions. [2024-10-11 08:05:28,001 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 268 transitions. Word has length 127 [2024-10-11 08:05:28,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:05:28,001 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 268 transitions. [2024-10-11 08:05:28,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 3 states have call successors, (30), 3 states have call predecessors, (30), 7 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-10-11 08:05:28,002 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 268 transitions. [2024-10-11 08:05:28,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 08:05:28,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:05:28,003 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:05:28,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 08:05:28,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:05:28,208 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:05:28,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:05:28,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1558302521, now seen corresponding path program 1 times [2024-10-11 08:05:28,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:05:28,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779314193] [2024-10-11 08:05:28,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:28,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:05:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:05:28,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1688548220] [2024-10-11 08:05:28,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:28,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:05:28,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:05:28,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:05:28,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 08:05:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:28,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 08:05:28,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:05:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 168 proven. 90 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-10-11 08:05:28,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:05:29,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:05:29,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779314193] [2024-10-11 08:05:29,399 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 08:05:29,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688548220] [2024-10-11 08:05:29,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688548220] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:05:29,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 08:05:29,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-10-11 08:05:29,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294174228] [2024-10-11 08:05:29,401 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 08:05:29,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 08:05:29,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:05:29,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 08:05:29,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=237, Unknown=6, NotChecked=0, Total=342 [2024-10-11 08:05:29,406 INFO L87 Difference]: Start difference. First operand 189 states and 268 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 08:05:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:05:29,973 INFO L93 Difference]: Finished difference Result 600 states and 818 transitions. [2024-10-11 08:05:29,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 08:05:29,974 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 127 [2024-10-11 08:05:29,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:05:29,977 INFO L225 Difference]: With dead ends: 600 [2024-10-11 08:05:29,977 INFO L226 Difference]: Without dead ends: 463 [2024-10-11 08:05:29,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=726, Unknown=6, NotChecked=0, Total=1056 [2024-10-11 08:05:29,982 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 170 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:05:29,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 665 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:05:29,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-11 08:05:30,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 389. [2024-10-11 08:05:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 266 states have (on average 1.263157894736842) internal successors, (336), 268 states have internal predecessors, (336), 99 states have call successors, (99), 23 states have call predecessors, (99), 23 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 08:05:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 534 transitions. [2024-10-11 08:05:30,022 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 534 transitions. Word has length 127 [2024-10-11 08:05:30,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:05:30,023 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 534 transitions. [2024-10-11 08:05:30,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 08:05:30,023 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 534 transitions. [2024-10-11 08:05:30,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 08:05:30,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:05:30,026 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:05:30,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 08:05:30,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:05:30,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:05:30,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:05:30,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1816467959, now seen corresponding path program 1 times [2024-10-11 08:05:30,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:05:30,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488017065] [2024-10-11 08:05:30,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:30,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:05:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:05:30,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1078314251] [2024-10-11 08:05:30,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:30,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:05:30,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:05:30,275 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:05:30,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 08:05:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:30,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 08:05:30,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:05:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 150 proven. 48 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-10-11 08:05:31,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:05:31,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:05:31,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488017065] [2024-10-11 08:05:31,658 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 08:05:31,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078314251] [2024-10-11 08:05:31,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078314251] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:05:31,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 08:05:31,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-11 08:05:31,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117430067] [2024-10-11 08:05:31,660 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 08:05:31,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 08:05:31,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:05:31,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 08:05:31,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2024-10-11 08:05:31,662 INFO L87 Difference]: Start difference. First operand 389 states and 534 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 08:05:32,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:05:32,259 INFO L93 Difference]: Finished difference Result 777 states and 1068 transitions. [2024-10-11 08:05:32,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 08:05:32,264 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2024-10-11 08:05:32,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:05:32,270 INFO L225 Difference]: With dead ends: 777 [2024-10-11 08:05:32,270 INFO L226 Difference]: Without dead ends: 640 [2024-10-11 08:05:32,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=466, Unknown=1, NotChecked=0, Total=650 [2024-10-11 08:05:32,271 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 110 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 49 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 08:05:32,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 683 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 484 Invalid, 6 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 08:05:32,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-10-11 08:05:32,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 540. [2024-10-11 08:05:32,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 369 states have (on average 1.2601626016260163) internal successors, (465), 371 states have internal predecessors, (465), 137 states have call successors, (137), 33 states have call predecessors, (137), 33 states have return successors, (137), 135 states have call predecessors, (137), 137 states have call successors, (137) [2024-10-11 08:05:32,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 739 transitions. [2024-10-11 08:05:32,324 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 739 transitions. Word has length 127 [2024-10-11 08:05:32,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:05:32,324 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 739 transitions. [2024-10-11 08:05:32,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 08:05:32,324 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 739 transitions. [2024-10-11 08:05:32,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 08:05:32,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:05:32,325 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:05:32,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 08:05:32,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:05:32,526 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:05:32,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:05:32,527 INFO L85 PathProgramCache]: Analyzing trace with hash -2041713726, now seen corresponding path program 1 times [2024-10-11 08:05:32,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:05:32,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126217850] [2024-10-11 08:05:32,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:32,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:05:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:05:32,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2072193698] [2024-10-11 08:05:32,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:32,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:05:32,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:05:32,578 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:05:32,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 08:05:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:05:32,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:05:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:05:32,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:05:32,774 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:05:32,775 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:05:32,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 08:05:32,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-11 08:05:32,980 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:05:33,049 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:05:33,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:05:33 BoogieIcfgContainer [2024-10-11 08:05:33,052 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:05:33,053 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:05:33,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:05:33,053 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:05:33,053 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:05:24" (3/4) ... [2024-10-11 08:05:33,054 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:05:33,055 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:05:33,056 INFO L158 Benchmark]: Toolchain (without parser) took 9461.47ms. Allocated memory was 142.6MB in the beginning and 308.3MB in the end (delta: 165.7MB). Free memory was 71.0MB in the beginning and 224.9MB in the end (delta: -153.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-10-11 08:05:33,056 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 142.6MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:05:33,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.68ms. Allocated memory is still 142.6MB. Free memory was 70.6MB in the beginning and 54.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 08:05:33,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.29ms. Allocated memory is still 142.6MB. Free memory was 54.9MB in the beginning and 51.1MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 08:05:33,057 INFO L158 Benchmark]: Boogie Preprocessor took 72.45ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 51.1MB in the beginning and 173.4MB in the end (delta: -122.3MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-10-11 08:05:33,057 INFO L158 Benchmark]: RCFGBuilder took 450.47ms. Allocated memory is still 205.5MB. Free memory was 173.3MB in the beginning and 147.0MB in the end (delta: 26.3MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-10-11 08:05:33,057 INFO L158 Benchmark]: TraceAbstraction took 8588.59ms. Allocated memory was 205.5MB in the beginning and 308.3MB in the end (delta: 102.8MB). Free memory was 146.0MB in the beginning and 224.9MB in the end (delta: -78.9MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2024-10-11 08:05:33,057 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 308.3MB. Free memory is still 224.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:05:33,058 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.12ms. Allocated memory is still 142.6MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.68ms. Allocated memory is still 142.6MB. Free memory was 70.6MB in the beginning and 54.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.29ms. Allocated memory is still 142.6MB. Free memory was 54.9MB in the beginning and 51.1MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.45ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 51.1MB in the beginning and 173.4MB in the end (delta: -122.3MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * RCFGBuilder took 450.47ms. Allocated memory is still 205.5MB. Free memory was 173.3MB in the beginning and 147.0MB in the end (delta: 26.3MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8588.59ms. Allocated memory was 205.5MB in the beginning and 308.3MB in the end (delta: 102.8MB). Free memory was 146.0MB in the beginning and 224.9MB in the end (delta: -78.9MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 308.3MB. Free memory is still 224.9MB. 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 150, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] unsigned char var_1_22 = 0; [L38] signed long int var_1_23 = -10; [L39] signed long int var_1_24 = 32; [L40] float var_1_25 = 1000000.8; [L41] float var_1_26 = 7.4; [L42] signed long int var_1_27 = 128; [L43] float var_1_28 = 9.75; [L44] signed long int var_1_29 = 10; [L45] signed short int last_1_var_1_1 = 16; [L46] unsigned char last_1_var_1_6 = 10; [L47] unsigned char last_1_var_1_8 = 1; [L48] signed short int last_1_var_1_13 = 200; [L154] isInitial = 1 [L155] FCALL initially() [L156] COND TRUE 1 [L157] CALL updateLastVariables() [L144] last_1_var_1_1 = var_1_1 [L145] last_1_var_1_6 = var_1_6 [L146] last_1_var_1_8 = var_1_8 [L147] last_1_var_1_13 = var_1_13 [L157] RET updateLastVariables() [L158] CALL updateVariables() [L112] var_1_5 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L113] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L114] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L114] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L115] var_1_7 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L116] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L117] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L117] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L118] var_1_11 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L119] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L120] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L120] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L121] var_1_12 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L122] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L123] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L123] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L124] var_1_15 = __VERIFIER_nondet_float() [L125] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L125] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L126] var_1_16 = __VERIFIER_nondet_float() [L127] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L127] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L128] var_1_20 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L129] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L130] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L130] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L131] var_1_22 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L132] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L133] CALL assume_abort_if_not(var_1_22 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L133] RET assume_abort_if_not(var_1_22 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=32, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L134] var_1_24 = __VERIFIER_nondet_long() [L135] CALL assume_abort_if_not(var_1_24 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L135] RET assume_abort_if_not(var_1_24 >= -2147483647) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L136] CALL assume_abort_if_not(var_1_24 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L136] RET assume_abort_if_not(var_1_24 <= 2147483646) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_26=37/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L137] var_1_26 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L138] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_27=128, var_1_28=39/4, var_1_29=10, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L139] var_1_29 = __VERIFIER_nondet_long() [L140] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_27=128, var_1_28=39/4, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_27=128, var_1_28=39/4, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L140] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_27=128, var_1_28=39/4, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L141] CALL assume_abort_if_not(var_1_29 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_27=128, var_1_28=39/4, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_27=128, var_1_28=39/4, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L141] RET assume_abort_if_not(var_1_29 <= 32) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-10, var_1_24=0, var_1_25=5000004/5, var_1_27=128, var_1_28=39/4, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L158] RET updateVariables() [L159] CALL step() [L52] var_1_21 = var_1_22 [L53] var_1_23 = var_1_24 [L54] var_1_25 = var_1_26 [L55] var_1_27 = -32 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=39/4, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L56] EXPR var_1_24 & 100 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=39/4, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L56] EXPR var_1_23 >> ((((var_1_29) > (5)) ? (var_1_29) : (5))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=39/4, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L56] COND TRUE (var_1_24 & 100) <= (var_1_23 >> ((((var_1_29) > (5)) ? (var_1_29) : (5)))) [L57] var_1_28 = var_1_26 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L59] signed long int stepLocal_6 = last_1_var_1_1; [L60] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L61] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L62] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L65] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L70] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L73] COND TRUE var_1_5 >= -2 [L74] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L76] unsigned char stepLocal_4 = var_1_6; [L77] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L78] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L79] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L80] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L87] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L88] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L91] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L92] COND TRUE \read(var_1_19) [L93] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L99] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L100] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-2, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L101] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L108] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-2, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] [L159] RET step() [L160] CALL, EXPR property() [L150-L151] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; [L160] RET, EXPR property() [L160] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=-32, var_1_28=2, var_1_29=1, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 7, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 735 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 714 mSDsluCounter, 2346 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1754 mSDsCounter, 295 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1360 IncrementalHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 295 mSolverCounterUnsat, 592 mSDtfsCounter, 1360 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 975 GetRequests, 868 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=6, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 290 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1397 NumberOfCodeBlocks, 1397 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1006 ConstructedInterpolants, 1 QuantifiedInterpolants, 6032 SizeOfPredicates, 16 NumberOfNonLiveVariables, 981 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 5178/5472 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 08:05:33,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d9e59086f90a4b77881e2a736ae7adfe917141d6ec019c4e22eac9e57a2e90b4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:05:34,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:05:34,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:05:34,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:05:34,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:05:34,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:05:34,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:05:34,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:05:34,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:05:34,956 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:05:34,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:05:34,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:05:34,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:05:34,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:05:34,959 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:05:34,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:05:34,959 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:05:34,960 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:05:34,960 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:05:34,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:05:34,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:05:34,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:05:34,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:05:34,963 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:05:34,964 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:05:34,964 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:05:34,964 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:05:34,964 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:05:34,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:05:34,965 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:05:34,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:05:34,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:05:34,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:05:34,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:05:34,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:05:34,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:05:34,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:05:34,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:05:34,966 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:05:34,966 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:05:34,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:05:34,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:05:34,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:05:34,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:05:34,967 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:05:34,968 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d9e59086f90a4b77881e2a736ae7adfe917141d6ec019c4e22eac9e57a2e90b4 [2024-10-11 08:05:35,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:05:35,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:05:35,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:05:35,266 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:05:35,267 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:05:35,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i [2024-10-11 08:05:36,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:05:36,670 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:05:36,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i [2024-10-11 08:05:36,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d430b609a/8183596071894d1fa738311985ea2f92/FLAGde0a0efff [2024-10-11 08:05:36,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d430b609a/8183596071894d1fa738311985ea2f92 [2024-10-11 08:05:36,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:05:36,699 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:05:36,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:05:36,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:05:36,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:05:36,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:05:36" (1/1) ... [2024-10-11 08:05:36,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce03d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:36, skipping insertion in model container [2024-10-11 08:05:36,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:05:36" (1/1) ... [2024-10-11 08:05:36,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:05:36,879 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i[915,928] [2024-10-11 08:05:36,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:05:36,959 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:05:36,968 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-42.i[915,928] [2024-10-11 08:05:37,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:05:37,020 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:05:37,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:37 WrapperNode [2024-10-11 08:05:37,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:05:37,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:05:37,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:05:37,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:05:37,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:37" (1/1) ... [2024-10-11 08:05:37,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:37" (1/1) ... [2024-10-11 08:05:37,070 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2024-10-11 08:05:37,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:05:37,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:05:37,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:05:37,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:05:37,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:37" (1/1) ... [2024-10-11 08:05:37,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:37" (1/1) ... [2024-10-11 08:05:37,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:37" (1/1) ... [2024-10-11 08:05:37,102 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 08:05:37,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:37" (1/1) ... [2024-10-11 08:05:37,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:37" (1/1) ... [2024-10-11 08:05:37,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:37" (1/1) ... [2024-10-11 08:05:37,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:37" (1/1) ... [2024-10-11 08:05:37,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:37" (1/1) ... [2024-10-11 08:05:37,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:37" (1/1) ... [2024-10-11 08:05:37,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:05:37,115 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:05:37,116 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:05:37,116 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:05:37,116 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:37" (1/1) ... [2024-10-11 08:05:37,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:05:37,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:05:37,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:05:37,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:05:37,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:05:37,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:05:37,178 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:05:37,178 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:05:37,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:05:37,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:05:37,249 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:05:37,250 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:05:37,551 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-11 08:05:37,551 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:05:37,617 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:05:37,617 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:05:37,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:05:37 BoogieIcfgContainer [2024-10-11 08:05:37,618 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:05:37,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:05:37,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:05:37,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:05:37,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:05:36" (1/3) ... [2024-10-11 08:05:37,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fecdcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:05:37, skipping insertion in model container [2024-10-11 08:05:37,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:05:37" (2/3) ... [2024-10-11 08:05:37,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fecdcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:05:37, skipping insertion in model container [2024-10-11 08:05:37,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:05:37" (3/3) ... [2024-10-11 08:05:37,626 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-42.i [2024-10-11 08:05:37,637 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:05:37,637 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:05:37,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:05:37,688 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;@63cce17b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:05:37,688 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:05:37,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 39 states have internal predecessors, (55), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 08:05:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 08:05:37,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:05:37,703 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:05:37,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:05:37,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:05:37,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1136470914, now seen corresponding path program 1 times [2024-10-11 08:05:37,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:05:37,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801205283] [2024-10-11 08:05:37,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:37,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:05:37,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:05:37,724 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:05:37,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 08:05:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:37,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:05:37,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:05:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-10-11 08:05:38,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:05:38,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:05:38,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801205283] [2024-10-11 08:05:38,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801205283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:05:38,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:05:38,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:05:38,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507165368] [2024-10-11 08:05:38,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:05:38,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:05:38,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:05:38,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:05:38,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:05:38,036 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 39 states have internal predecessors, (55), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 08:05:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:05:38,121 INFO L93 Difference]: Finished difference Result 117 states and 203 transitions. [2024-10-11 08:05:38,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:05:38,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2024-10-11 08:05:38,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:05:38,132 INFO L225 Difference]: With dead ends: 117 [2024-10-11 08:05:38,132 INFO L226 Difference]: Without dead ends: 58 [2024-10-11 08:05:38,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:05:38,137 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:05:38,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:05:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-11 08:05:38,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-11 08:05:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 08:05:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 88 transitions. [2024-10-11 08:05:38,167 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 88 transitions. Word has length 124 [2024-10-11 08:05:38,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:05:38,167 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 88 transitions. [2024-10-11 08:05:38,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 08:05:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 88 transitions. [2024-10-11 08:05:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 08:05:38,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:05:38,171 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:05:38,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 08:05:38,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:05:38,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:05:38,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:05:38,373 INFO L85 PathProgramCache]: Analyzing trace with hash -128251904, now seen corresponding path program 1 times [2024-10-11 08:05:38,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:05:38,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193443932] [2024-10-11 08:05:38,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:38,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:05:38,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:05:38,377 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:05:38,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 08:05:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:38,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 08:05:38,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:05:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 08:05:38,818 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:05:38,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:05:38,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193443932] [2024-10-11 08:05:38,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193443932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:05:38,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:05:38,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:05:38,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020592134] [2024-10-11 08:05:38,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:05:38,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:05:38,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:05:38,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:05:38,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:05:38,822 INFO L87 Difference]: Start difference. First operand 58 states and 88 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 08:05:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:05:39,042 INFO L93 Difference]: Finished difference Result 173 states and 263 transitions. [2024-10-11 08:05:39,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:05:39,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2024-10-11 08:05:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:05:39,050 INFO L225 Difference]: With dead ends: 173 [2024-10-11 08:05:39,050 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 08:05:39,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:05:39,054 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 71 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:05:39,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 249 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:05:39,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 08:05:39,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2024-10-11 08:05:39,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 55 states have internal predecessors, (69), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 08:05:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 145 transitions. [2024-10-11 08:05:39,089 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 145 transitions. Word has length 124 [2024-10-11 08:05:39,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:05:39,089 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 145 transitions. [2024-10-11 08:05:39,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 08:05:39,090 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 145 transitions. [2024-10-11 08:05:39,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 08:05:39,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:05:39,093 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:05:39,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 08:05:39,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:05:39,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:05:39,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:05:39,294 INFO L85 PathProgramCache]: Analyzing trace with hash -348339201, now seen corresponding path program 1 times [2024-10-11 08:05:39,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:05:39,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551839111] [2024-10-11 08:05:39,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:39,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:05:39,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:05:39,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:05:39,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 08:05:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:39,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 08:05:39,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:05:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 08:05:39,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:05:39,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:05:39,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551839111] [2024-10-11 08:05:39,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551839111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:05:39,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:05:39,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:05:39,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459155269] [2024-10-11 08:05:39,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:05:39,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:05:39,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:05:39,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:05:39,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:05:39,985 INFO L87 Difference]: Start difference. First operand 96 states and 145 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 08:05:40,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:05:40,512 INFO L93 Difference]: Finished difference Result 253 states and 385 transitions. [2024-10-11 08:05:40,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 08:05:40,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2024-10-11 08:05:40,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:05:40,519 INFO L225 Difference]: With dead ends: 253 [2024-10-11 08:05:40,519 INFO L226 Difference]: Without dead ends: 196 [2024-10-11 08:05:40,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 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-11 08:05:40,520 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 100 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 08:05:40,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 348 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 08:05:40,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-11 08:05:40,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 151. [2024-10-11 08:05:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 90 states have (on average 1.288888888888889) internal successors, (116), 90 states have internal predecessors, (116), 57 states have call successors, (57), 3 states have call predecessors, (57), 3 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-11 08:05:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 230 transitions. [2024-10-11 08:05:40,541 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 230 transitions. Word has length 125 [2024-10-11 08:05:40,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:05:40,542 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 230 transitions. [2024-10-11 08:05:40,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 08:05:40,542 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2024-10-11 08:05:40,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 08:05:40,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:05:40,544 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:05:40,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 08:05:40,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:05:40,745 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:05:40,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:05:40,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1359456451, now seen corresponding path program 1 times [2024-10-11 08:05:40,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:05:40,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890206253] [2024-10-11 08:05:40,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:40,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:05:40,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:05:40,750 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:05:40,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 08:05:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:40,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 08:05:40,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:05:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 443 proven. 51 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 08:05:41,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:05:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 54 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-10-11 08:05:41,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:05:41,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890206253] [2024-10-11 08:05:41,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890206253] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:05:41,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 08:05:41,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-10-11 08:05:41,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869141496] [2024-10-11 08:05:41,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 08:05:41,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 08:05:41,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:05:41,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 08:05:41,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-11 08:05:41,434 INFO L87 Difference]: Start difference. First operand 151 states and 230 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (30), 3 states have call predecessors, (30), 7 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-11 08:05:42,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:05:42,259 INFO L93 Difference]: Finished difference Result 330 states and 466 transitions. [2024-10-11 08:05:42,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 08:05:42,260 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (30), 3 states have call predecessors, (30), 7 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 125 [2024-10-11 08:05:42,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:05:42,262 INFO L225 Difference]: With dead ends: 330 [2024-10-11 08:05:42,262 INFO L226 Difference]: Without dead ends: 273 [2024-10-11 08:05:42,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 08:05:42,267 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 244 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 08:05:42,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 365 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 08:05:42,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-11 08:05:42,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 247. [2024-10-11 08:05:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 158 states have (on average 1.2658227848101267) internal successors, (200), 158 states have internal predecessors, (200), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-11 08:05:42,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 352 transitions. [2024-10-11 08:05:42,358 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 352 transitions. Word has length 125 [2024-10-11 08:05:42,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:05:42,362 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 352 transitions. [2024-10-11 08:05:42,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (30), 3 states have call predecessors, (30), 7 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-11 08:05:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 352 transitions. [2024-10-11 08:05:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 08:05:42,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:05:42,364 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:05:42,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 08:05:42,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:05:42,565 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:05:42,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:05:42,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1946262465, now seen corresponding path program 1 times [2024-10-11 08:05:42,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:05:42,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310844348] [2024-10-11 08:05:42,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:42,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:05:42,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:05:42,568 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:05:42,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 08:05:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:42,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 08:05:42,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:05:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 150 proven. 48 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-10-11 08:05:43,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:05:43,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:05:43,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310844348] [2024-10-11 08:05:43,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310844348] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:05:43,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1348997909] [2024-10-11 08:05:43,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:43,472 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 08:05:43,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 08:05:43,474 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 08:05:43,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-11 08:05:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:43,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 08:05:43,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:05:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 08:05:44,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:05:44,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1348997909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:05:44,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 08:05:44,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-10-11 08:05:44,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112269513] [2024-10-11 08:05:44,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:05:44,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 08:05:44,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:05:44,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 08:05:44,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 08:05:44,315 INFO L87 Difference]: Start difference. First operand 247 states and 352 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 08:05:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:05:45,733 INFO L93 Difference]: Finished difference Result 675 states and 957 transitions. [2024-10-11 08:05:45,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 08:05:45,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2024-10-11 08:05:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:05:45,746 INFO L225 Difference]: With dead ends: 675 [2024-10-11 08:05:45,749 INFO L226 Difference]: Without dead ends: 548 [2024-10-11 08:05:45,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-11 08:05:45,750 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 119 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:05:45,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 391 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 08:05:45,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-10-11 08:05:45,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 480. [2024-10-11 08:05:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 319 states have (on average 1.2852664576802508) internal successors, (410), 321 states have internal predecessors, (410), 137 states have call successors, (137), 23 states have call predecessors, (137), 23 states have return successors, (137), 135 states have call predecessors, (137), 137 states have call successors, (137) [2024-10-11 08:05:45,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 684 transitions. [2024-10-11 08:05:45,792 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 684 transitions. Word has length 125 [2024-10-11 08:05:45,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:05:45,793 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 684 transitions. [2024-10-11 08:05:45,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 08:05:45,793 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 684 transitions. [2024-10-11 08:05:45,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 08:05:45,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:05:45,794 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:05:45,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 08:05:46,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-10-11 08:05:46,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 08:05:46,197 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:05:46,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:05:46,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1688097027, now seen corresponding path program 1 times [2024-10-11 08:05:46,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:05:46,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335327813] [2024-10-11 08:05:46,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:46,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:05:46,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:05:46,201 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:05:46,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 08:05:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:46,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 08:05:46,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:05:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 150 proven. 48 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-10-11 08:05:46,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:05:47,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:05:47,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335327813] [2024-10-11 08:05:47,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335327813] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:05:47,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1224285174] [2024-10-11 08:05:47,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:47,080 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 08:05:47,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 08:05:47,081 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 08:05:47,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-11 08:05:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:47,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 08:05:47,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:05:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 08:05:48,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:05:48,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1224285174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:05:48,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 08:05:48,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-11 08:05:48,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835575304] [2024-10-11 08:05:48,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:05:48,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:05:48,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:05:48,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:05:48,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-11 08:05:48,125 INFO L87 Difference]: Start difference. First operand 480 states and 684 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 08:05:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:05:49,364 INFO L93 Difference]: Finished difference Result 838 states and 1195 transitions. [2024-10-11 08:05:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:05:49,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2024-10-11 08:05:49,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:05:49,368 INFO L225 Difference]: With dead ends: 838 [2024-10-11 08:05:49,368 INFO L226 Difference]: Without dead ends: 644 [2024-10-11 08:05:49,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-11 08:05:49,370 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 71 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:05:49,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 331 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 08:05:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-10-11 08:05:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 605. [2024-10-11 08:05:49,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 400 states have (on average 1.2775) internal successors, (511), 402 states have internal predecessors, (511), 175 states have call successors, (175), 29 states have call predecessors, (175), 29 states have return successors, (175), 173 states have call predecessors, (175), 175 states have call successors, (175) [2024-10-11 08:05:49,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 861 transitions. [2024-10-11 08:05:49,427 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 861 transitions. Word has length 125 [2024-10-11 08:05:49,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:05:49,428 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 861 transitions. [2024-10-11 08:05:49,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 08:05:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 861 transitions. [2024-10-11 08:05:49,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 08:05:49,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:05:49,429 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:05:49,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-11 08:05:49,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-10-11 08:05:49,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 08:05:49,830 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:05:49,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:05:49,831 INFO L85 PathProgramCache]: Analyzing trace with hash 985921385, now seen corresponding path program 1 times [2024-10-11 08:05:49,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:05:49,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334255393] [2024-10-11 08:05:49,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:05:49,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:05:49,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:05:49,834 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:05:49,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 08:05:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:05:50,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 08:05:50,006 INFO L278 TraceCheckSpWp]: Computing forward predicates...