./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-40.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 176f03b1400c1ac7dc9e88fd771da3300863068aea109920745c2a40ee9af7e9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:01:23,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:01:23,624 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:01:23,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:01:23,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:01:23,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:01:23,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:01:23,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:01:23,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:01:23,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:01:23,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:01:23,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:01:23,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:01:23,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:01:23,657 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:01:23,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:01:23,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:01:23,658 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:01:23,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:01:23,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:01:23,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:01:23,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:01:23,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:01:23,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:01:23,663 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:01:23,663 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:01:23,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:01:23,663 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:01:23,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:01:23,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:01:23,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:01:23,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:01:23,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:01:23,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:01:23,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:01:23,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:01:23,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:01:23,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:01:23,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:01:23,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:01:23,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:01:23,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:01:23,667 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 -> 176f03b1400c1ac7dc9e88fd771da3300863068aea109920745c2a40ee9af7e9 [2024-10-11 10:01:23,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:01:23,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:01:23,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:01:23,929 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:01:23,929 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:01:23,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-40.i [2024-10-11 10:01:25,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:01:25,438 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:01:25,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-40.i [2024-10-11 10:01:25,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/093457fc6/9214c937eb4d4dbb8e2194ff14170abf/FLAG37a1ababe [2024-10-11 10:01:25,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/093457fc6/9214c937eb4d4dbb8e2194ff14170abf [2024-10-11 10:01:25,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:01:25,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:01:25,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:01:25,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:01:25,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:01:25,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:01:25" (1/1) ... [2024-10-11 10:01:25,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5060130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:25, skipping insertion in model container [2024-10-11 10:01:25,472 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:01:25" (1/1) ... [2024-10-11 10:01:25,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:01:25,658 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-40.i[919,932] [2024-10-11 10:01:25,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:01:25,777 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:01:25,791 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-40.i[919,932] [2024-10-11 10:01:25,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:01:25,910 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:01:25,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:25 WrapperNode [2024-10-11 10:01:25,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:01:25,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:01:25,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:01:25,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:01:25,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:25" (1/1) ... [2024-10-11 10:01:25,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:25" (1/1) ... [2024-10-11 10:01:25,966 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-10-11 10:01:25,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:01:25,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:01:25,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:01:25,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:01:25,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:25" (1/1) ... [2024-10-11 10:01:25,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:25" (1/1) ... [2024-10-11 10:01:25,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:25" (1/1) ... [2024-10-11 10:01:26,010 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:01:26,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:25" (1/1) ... [2024-10-11 10:01:26,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:25" (1/1) ... [2024-10-11 10:01:26,019 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:25" (1/1) ... [2024-10-11 10:01:26,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:25" (1/1) ... [2024-10-11 10:01:26,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:25" (1/1) ... [2024-10-11 10:01:26,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:25" (1/1) ... [2024-10-11 10:01:26,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:01:26,049 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:01:26,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:01:26,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:01:26,051 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:25" (1/1) ... [2024-10-11 10:01:26,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:01:26,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:01:26,082 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:01:26,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:01:26,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:01:26,126 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:01:26,127 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:01:26,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:01:26,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:01:26,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:01:26,205 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:01:26,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:01:26,519 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 10:01:26,520 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:01:26,555 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:01:26,556 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:01:26,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:01:26 BoogieIcfgContainer [2024-10-11 10:01:26,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:01:26,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:01:26,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:01:26,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:01:26,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:01:25" (1/3) ... [2024-10-11 10:01:26,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15127f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:01:26, skipping insertion in model container [2024-10-11 10:01:26,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:25" (2/3) ... [2024-10-11 10:01:26,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15127f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:01:26, skipping insertion in model container [2024-10-11 10:01:26,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:01:26" (3/3) ... [2024-10-11 10:01:26,565 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-40.i [2024-10-11 10:01:26,580 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:01:26,580 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:01:26,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:01:26,636 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;@7ef62aab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:01:26,636 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:01:26,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:01:26,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 10:01:26,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:01:26,652 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:01:26,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:01:26,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:01:26,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1810436653, now seen corresponding path program 1 times [2024-10-11 10:01:26,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:01:26,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087483328] [2024-10-11 10:01:26,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:01:26,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:01:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:26,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:01:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:26,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:01:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:26,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:01:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:26,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:01:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:26,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:01:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:26,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:01:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:26,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:01:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:26,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:01:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:26,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:01:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:26,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:01:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:26,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:01:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:26,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:01:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:26,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:01:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:01:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:01:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:01:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:01:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:01:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,060 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:01:27,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:01:27,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087483328] [2024-10-11 10:01:27,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087483328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:01:27,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:01:27,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:01:27,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235938382] [2024-10-11 10:01:27,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:01:27,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:01:27,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:01:27,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:01:27,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:01:27,095 INFO L87 Difference]: Start difference. First operand has 67 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 10:01:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:01:27,127 INFO L93 Difference]: Finished difference Result 129 states and 227 transitions. [2024-10-11 10:01:27,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:01:27,130 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124 [2024-10-11 10:01:27,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:01:27,145 INFO L225 Difference]: With dead ends: 129 [2024-10-11 10:01:27,145 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 10:01:27,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:01:27,161 INFO L432 NwaCegarLoop]: 94 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, 94 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:01:27,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:01:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 10:01:27,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-11 10:01:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 43 states have internal predecessors, (61), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:01:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2024-10-11 10:01:27,213 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 124 [2024-10-11 10:01:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:01:27,215 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2024-10-11 10:01:27,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 10:01:27,215 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2024-10-11 10:01:27,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 10:01:27,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:01:27,220 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:01:27,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:01:27,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:01:27,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:01:27,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1920125711, now seen corresponding path program 1 times [2024-10-11 10:01:27,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:01:27,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940820795] [2024-10-11 10:01:27,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:01:27,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:01:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:01:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:01:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:01:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:01:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:01:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:01:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:01:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:01:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:01:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:01:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:01:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:01:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:01:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:01:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:01:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:01:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:01:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:01:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:01:27,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:01:27,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940820795] [2024-10-11 10:01:27,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940820795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:01:27,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:01:27,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:01:27,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664497721] [2024-10-11 10:01:27,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:01:27,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:01:27,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:01:27,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:01:27,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:01:27,515 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:01:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:01:27,587 INFO L93 Difference]: Finished difference Result 169 states and 259 transitions. [2024-10-11 10:01:27,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:01:27,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2024-10-11 10:01:27,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:01:27,590 INFO L225 Difference]: With dead ends: 169 [2024-10-11 10:01:27,594 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 10:01:27,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:01:27,596 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 59 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:01:27,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 183 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:01:27,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 10:01:27,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2024-10-11 10:01:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 10:01:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2024-10-11 10:01:27,624 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 125 [2024-10-11 10:01:27,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:01:27,626 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2024-10-11 10:01:27,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:01:27,627 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2024-10-11 10:01:27,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 10:01:27,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:01:27,628 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:01:27,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:01:27,629 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:01:27,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:01:27,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1952139759, now seen corresponding path program 1 times [2024-10-11 10:01:27,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:01:27,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511072541] [2024-10-11 10:01:27,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:01:27,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:01:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:01:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:01:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:01:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:01:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:01:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:01:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:01:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:01:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:01:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:01:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:01:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:01:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:01:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:01:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:01:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:01:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:01:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:01:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:01:27,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:01:27,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511072541] [2024-10-11 10:01:27,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511072541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:01:27,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:01:27,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:01:27,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930536998] [2024-10-11 10:01:27,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:01:27,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:01:27,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:01:27,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:01:27,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:01:27,855 INFO L87 Difference]: Start difference. First operand 104 states and 159 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:01:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:01:27,999 INFO L93 Difference]: Finished difference Result 296 states and 450 transitions. [2024-10-11 10:01:27,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:01:28,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2024-10-11 10:01:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:01:28,003 INFO L225 Difference]: With dead ends: 296 [2024-10-11 10:01:28,003 INFO L226 Difference]: Without dead ends: 193 [2024-10-11 10:01:28,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:01:28,006 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 66 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:01:28,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 232 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:01:28,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-11 10:01:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2024-10-11 10:01:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 141 states have (on average 1.4184397163120568) internal successors, (200), 144 states have internal predecessors, (200), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 10:01:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 288 transitions. [2024-10-11 10:01:28,051 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 288 transitions. Word has length 125 [2024-10-11 10:01:28,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:01:28,052 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 288 transitions. [2024-10-11 10:01:28,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:01:28,052 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 288 transitions. [2024-10-11 10:01:28,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 10:01:28,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:01:28,054 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:01:28,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:01:28,054 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:01:28,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:01:28,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1321759183, now seen corresponding path program 1 times [2024-10-11 10:01:28,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:01:28,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63292943] [2024-10-11 10:01:28,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:01:28,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:01:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:01:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:01:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:01:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:01:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:01:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:01:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:01:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:01:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:01:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:01:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:01:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:01:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:01:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:01:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:01:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:01:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:01:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:01:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:01:28,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:01:28,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63292943] [2024-10-11 10:01:28,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63292943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:01:28,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:01:28,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:01:28,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570163713] [2024-10-11 10:01:28,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:01:28,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:01:28,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:01:28,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:01:28,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:01:28,226 INFO L87 Difference]: Start difference. First operand 190 states and 288 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:01:28,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:01:28,258 INFO L93 Difference]: Finished difference Result 379 states and 575 transitions. [2024-10-11 10:01:28,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:01:28,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2024-10-11 10:01:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:01:28,261 INFO L225 Difference]: With dead ends: 379 [2024-10-11 10:01:28,261 INFO L226 Difference]: Without dead ends: 190 [2024-10-11 10:01:28,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:01:28,267 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:01:28,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:01:28,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-11 10:01:28,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-10-11 10:01:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 141 states have (on average 1.3900709219858156) internal successors, (196), 144 states have internal predecessors, (196), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 10:01:28,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 284 transitions. [2024-10-11 10:01:28,301 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 284 transitions. Word has length 125 [2024-10-11 10:01:28,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:01:28,302 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 284 transitions. [2024-10-11 10:01:28,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:01:28,304 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 284 transitions. [2024-10-11 10:01:28,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 10:01:28,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:01:28,306 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:01:28,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:01:28,309 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:01:28,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:01:28,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1198200751, now seen corresponding path program 1 times [2024-10-11 10:01:28,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:01:28,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951439999] [2024-10-11 10:01:28,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:01:28,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:01:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:01:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:01:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:01:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:01:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:01:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:01:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:01:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:01:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:01:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:01:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:01:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:01:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:01:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:01:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:01:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:01:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:01:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:01:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:01:28,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:01:28,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951439999] [2024-10-11 10:01:28,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951439999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:01:28,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:01:28,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:01:28,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653981947] [2024-10-11 10:01:28,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:01:28,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:01:28,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:01:28,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:01:28,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:01:28,558 INFO L87 Difference]: Start difference. First operand 190 states and 284 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:01:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:01:28,701 INFO L93 Difference]: Finished difference Result 604 states and 893 transitions. [2024-10-11 10:01:28,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:01:28,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2024-10-11 10:01:28,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:01:28,707 INFO L225 Difference]: With dead ends: 604 [2024-10-11 10:01:28,708 INFO L226 Difference]: Without dead ends: 415 [2024-10-11 10:01:28,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:01:28,712 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 164 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:01:28,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 321 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:01:28,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-11 10:01:28,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 375. [2024-10-11 10:01:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 278 states have (on average 1.3633093525179856) internal successors, (379), 284 states have internal predecessors, (379), 88 states have call successors, (88), 8 states have call predecessors, (88), 8 states have return successors, (88), 82 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-11 10:01:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 555 transitions. [2024-10-11 10:01:28,763 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 555 transitions. Word has length 125 [2024-10-11 10:01:28,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:01:28,765 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 555 transitions. [2024-10-11 10:01:28,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:01:28,766 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 555 transitions. [2024-10-11 10:01:28,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 10:01:28,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:01:28,767 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:01:28,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:01:28,768 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:01:28,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:01:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1591227761, now seen corresponding path program 1 times [2024-10-11 10:01:28,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:01:28,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033152422] [2024-10-11 10:01:28,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:01:28,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:01:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:01:28,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1871460778] [2024-10-11 10:01:28,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:01:28,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:01:28,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:01:28,866 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:01:28,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:01:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:01:29,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:01:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:01:29,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:01:29,232 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:01:29,233 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:01:29,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 10:01:29,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:01:29,438 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 10:01:29,541 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:01:29,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:01:29 BoogieIcfgContainer [2024-10-11 10:01:29,545 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:01:29,545 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:01:29,546 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:01:29,546 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:01:29,546 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:01:26" (3/4) ... [2024-10-11 10:01:29,548 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:01:29,549 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:01:29,550 INFO L158 Benchmark]: Toolchain (without parser) took 4085.14ms. Allocated memory was 136.3MB in the beginning and 247.5MB in the end (delta: 111.1MB). Free memory was 66.0MB in the beginning and 73.0MB in the end (delta: -6.9MB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. [2024-10-11 10:01:29,550 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 136.3MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:01:29,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.63ms. Allocated memory was 136.3MB in the beginning and 184.5MB in the end (delta: 48.2MB). Free memory was 65.7MB in the beginning and 153.2MB in the end (delta: -87.4MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2024-10-11 10:01:29,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.81ms. Allocated memory is still 184.5MB. Free memory was 153.2MB in the beginning and 148.1MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:01:29,551 INFO L158 Benchmark]: Boogie Preprocessor took 81.25ms. Allocated memory is still 184.5MB. Free memory was 148.1MB in the beginning and 140.6MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 10:01:29,551 INFO L158 Benchmark]: RCFGBuilder took 508.16ms. Allocated memory is still 184.5MB. Free memory was 140.6MB in the beginning and 111.3MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 10:01:29,554 INFO L158 Benchmark]: TraceAbstraction took 2986.51ms. Allocated memory was 184.5MB in the beginning and 247.5MB in the end (delta: 62.9MB). Free memory was 110.3MB in the beginning and 73.0MB in the end (delta: 37.4MB). Peak memory consumption was 100.0MB. Max. memory is 16.1GB. [2024-10-11 10:01:29,554 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 247.5MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:01:29,555 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.08ms. Allocated memory is still 136.3MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.63ms. Allocated memory was 136.3MB in the beginning and 184.5MB in the end (delta: 48.2MB). Free memory was 65.7MB in the beginning and 153.2MB in the end (delta: -87.4MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.81ms. Allocated memory is still 184.5MB. Free memory was 153.2MB in the beginning and 148.1MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.25ms. Allocated memory is still 184.5MB. Free memory was 148.1MB in the beginning and 140.6MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 508.16ms. Allocated memory is still 184.5MB. Free memory was 140.6MB in the beginning and 111.3MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2986.51ms. Allocated memory was 184.5MB in the beginning and 247.5MB in the end (delta: 62.9MB). Free memory was 110.3MB in the beginning and 73.0MB in the end (delta: 37.4MB). Peak memory consumption was 100.0MB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 247.5MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someUnaryDOUBLEoperation at line 35. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] unsigned long int var_1_34 = 50; [L42] double var_1_35 = 31.1; [L43] unsigned long int var_1_37 = 64; [L44] signed long int var_1_38 = 8; [L45] float var_1_39 = 200.6; [L46] unsigned short int var_1_40 = 2; [L47] signed char var_1_42 = -4; [L48] double var_1_43 = 2.75; [L49] signed char var_1_45 = 32; [L50] unsigned long int var_1_46 = 32; [L51] signed long int var_1_47 = -256; [L52] unsigned char last_1_var_1_9 = 1; [L53] float last_1_var_1_24 = 128.5; [L164] isInitial = 1 [L165] FCALL initially() [L166] COND TRUE 1 [L167] CALL updateLastVariables() [L156] last_1_var_1_9 = var_1_9 [L157] last_1_var_1_24 = var_1_24 [L167] RET updateLastVariables() [L168] CALL updateVariables() [L127] var_1_4 = __VERIFIER_nondet_short() [L128] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L128] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L129] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L130] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L130] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L131] var_1_8 = __VERIFIER_nondet_ushort() [L132] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_9=1] [L132] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_9=1] [L133] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L133] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L134] var_1_10 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L135] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L136] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L137] var_1_11 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L139] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L140] var_1_15 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L142] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L142] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L143] var_1_20 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L145] var_1_28 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=2, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=2, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=2, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=2, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=2, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=2, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L148] var_1_29 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L151] var_1_39 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_39 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L153] RET assume_abort_if_not(var_1_39 != 0.0F) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L168] RET updateVariables() [L169] CALL step() [L57] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L58] COND FALSE !(var_1_9 && var_1_11) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L61] COND FALSE !(var_1_28 > var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L66] var_1_35 = var_1_20 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L67] COND FALSE !((var_1_9 && var_1_11) && (var_1_21 > var_1_15)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L70] COND FALSE !((((((var_1_20 / var_1_39)) > (var_1_20)) ? ((var_1_20 / var_1_39)) : (var_1_20))) > 100.3) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L75] COND TRUE var_1_12 > ((var_1_29 >> 1) + var_1_21) [L76] var_1_40 = (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) + ((((var_1_29) < 0 ) ? -(var_1_29) : (var_1_29)))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=6, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L78] COND TRUE var_1_11 || var_1_9 [L79] var_1_42 = 1 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=6, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L81] EXPR var_1_12 | var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=6, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L81] COND FALSE !(var_1_28 > (var_1_12 | var_1_12)) [L84] var_1_45 = var_1_28 [L85] var_1_46 = var_1_15 [L86] var_1_47 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=16, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=6, var_1_42=1, var_1_43=11/4, var_1_45=2, var_1_46=5, var_1_47=16, var_1_4=4, var_1_8=0, var_1_9=1] [L87] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L94] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=261, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=6, var_1_42=1, var_1_43=11/4, var_1_45=2, var_1_46=5, var_1_47=16, var_1_4=4, var_1_8=0, var_1_9=1] [L96] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=257, var_1_10=257, var_1_11=0, var_1_12=261, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=6, var_1_42=1, var_1_43=11/4, var_1_45=2, var_1_46=5, var_1_47=16, var_1_4=4, var_1_8=0, var_1_9=1] [L97] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L98] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=261, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=6, var_1_42=1, var_1_43=11/4, var_1_45=2, var_1_46=5, var_1_47=16, var_1_4=4, var_1_8=0, var_1_9=0] [L100] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=261, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=0, var_1_24=257/2, var_1_26=5, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=6, var_1_42=1, var_1_43=11/4, var_1_45=2, var_1_46=5, var_1_47=16, var_1_4=4, var_1_8=0, var_1_9=0] [L101] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L104] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=261, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_26=5, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=6, var_1_42=1, var_1_43=11/4, var_1_45=2, var_1_46=5, var_1_47=16, var_1_4=4, var_1_8=0, var_1_9=0] [L106] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=257, var_1_11=0, var_1_12=261, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_26=5, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=6, var_1_42=1, var_1_43=11/4, var_1_45=2, var_1_46=5, var_1_47=16, var_1_4=4, var_1_8=0, var_1_9=0] [L107] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=257, var_1_11=0, var_1_12=261, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_26=5, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=6, var_1_42=1, var_1_43=11/4, var_1_45=2, var_1_46=5, var_1_47=16, var_1_4=4, var_1_8=0, var_1_9=0] [L110] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=261, var_1_15=261, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_26=5, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=6, var_1_42=1, var_1_43=11/4, var_1_45=2, var_1_46=5, var_1_47=16, var_1_4=4, var_1_8=0, var_1_9=0] [L114] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L115] var_1_25 = var_1_20 [L116] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=5, var_1_10=257, var_1_11=0, var_1_12=261, var_1_15=261, var_1_16=5, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=5, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=6, var_1_42=1, var_1_43=11/4, var_1_45=2, var_1_46=5, var_1_47=16, var_1_4=4, var_1_8=0, var_1_9=0] [L117] COND FALSE !(((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0) [L120] var_1_1 = (var_1_12 + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=261, var_1_15=261, var_1_16=5, var_1_17=127/5, var_1_1=10, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=5, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=6, var_1_42=1, var_1_43=11/4, var_1_45=2, var_1_46=5, var_1_47=16, var_1_4=4, var_1_8=0, var_1_9=0] [L122] COND TRUE (var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16) [L123] var_1_17 = var_1_20 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=261, var_1_15=261, var_1_16=5, var_1_17=2, var_1_1=10, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=5, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=6, var_1_42=1, var_1_43=11/4, var_1_45=2, var_1_46=5, var_1_47=16, var_1_4=4, var_1_8=0, var_1_9=0] [L169] RET step() [L170] CALL, EXPR property() [L160-L161] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; [L170] RET, EXPR property() [L170] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=261, var_1_15=261, var_1_16=5, var_1_17=2, var_1_1=10, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=5, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=6, var_1_42=1, var_1_43=11/4, var_1_45=2, var_1_46=5, var_1_47=16, var_1_4=4, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=257, var_1_11=0, var_1_12=261, var_1_15=261, var_1_16=5, var_1_17=2, var_1_1=10, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=5, var_1_27=1, var_1_28=2, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=6, var_1_42=1, var_1_43=11/4, var_1_45=2, var_1_46=5, var_1_47=16, var_1_4=4, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 6, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 289 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 289 mSDsluCounter, 1011 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 528 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 195 IncrementalHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 483 mSDtfsCounter, 195 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=375occurred in iteration=5, InterpolantAutomatonStates: 17, 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, 5 MinimizatonAttempts, 46 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 874 NumberOfCodeBlocks, 874 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 619 ConstructedInterpolants, 0 QuantifiedInterpolants, 885 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 3060/3060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 10:01:29,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-40.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 176f03b1400c1ac7dc9e88fd771da3300863068aea109920745c2a40ee9af7e9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:01:31,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:01:31,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:01:31,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:01:31,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:01:31,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:01:31,819 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:01:31,819 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:01:31,820 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:01:31,821 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:01:31,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:01:31,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:01:31,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:01:31,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:01:31,823 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:01:31,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:01:31,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:01:31,823 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:01:31,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:01:31,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:01:31,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:01:31,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:01:31,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:01:31,825 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:01:31,825 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:01:31,825 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:01:31,825 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:01:31,826 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:01:31,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:01:31,826 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:01:31,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:01:31,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:01:31,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:01:31,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:01:31,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:01:31,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:01:31,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:01:31,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:01:31,828 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:01:31,828 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:01:31,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:01:31,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:01:31,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:01:31,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:01:31,829 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:01:31,829 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 -> 176f03b1400c1ac7dc9e88fd771da3300863068aea109920745c2a40ee9af7e9 [2024-10-11 10:01:32,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:01:32,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:01:32,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:01:32,084 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:01:32,084 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:01:32,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-40.i [2024-10-11 10:01:33,516 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:01:33,680 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:01:33,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-40.i [2024-10-11 10:01:33,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/34e297a61/7768bc20498a4c7f83fe607aae1228f6/FLAG9ddfa3162 [2024-10-11 10:01:33,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/34e297a61/7768bc20498a4c7f83fe607aae1228f6 [2024-10-11 10:01:33,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:01:33,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:01:33,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:01:33,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:01:33,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:01:33,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:01:33" (1/1) ... [2024-10-11 10:01:33,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65a8670f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:33, skipping insertion in model container [2024-10-11 10:01:33,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:01:33" (1/1) ... [2024-10-11 10:01:33,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:01:33,915 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-40.i[919,932] [2024-10-11 10:01:33,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:01:34,002 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:01:34,012 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-40.i[919,932] [2024-10-11 10:01:34,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:01:34,072 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:01:34,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:34 WrapperNode [2024-10-11 10:01:34,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:01:34,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:01:34,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:01:34,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:01:34,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:34" (1/1) ... [2024-10-11 10:01:34,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:34" (1/1) ... [2024-10-11 10:01:34,126 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-10-11 10:01:34,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:01:34,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:01:34,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:01:34,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:01:34,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:34" (1/1) ... [2024-10-11 10:01:34,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:34" (1/1) ... [2024-10-11 10:01:34,142 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:34" (1/1) ... [2024-10-11 10:01:34,159 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:01:34,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:34" (1/1) ... [2024-10-11 10:01:34,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:34" (1/1) ... [2024-10-11 10:01:34,170 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:34" (1/1) ... [2024-10-11 10:01:34,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:34" (1/1) ... [2024-10-11 10:01:34,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:34" (1/1) ... [2024-10-11 10:01:34,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:34" (1/1) ... [2024-10-11 10:01:34,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:01:34,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:01:34,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:01:34,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:01:34,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:34" (1/1) ... [2024-10-11 10:01:34,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:01:34,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:01:34,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:01:34,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:01:34,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:01:34,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:01:34,266 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:01:34,266 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:01:34,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:01:34,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:01:34,393 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:01:34,395 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:01:37,916 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 10:01:37,916 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:01:37,950 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:01:37,950 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:01:37,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:01:37 BoogieIcfgContainer [2024-10-11 10:01:37,950 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:01:37,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:01:37,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:01:37,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:01:37,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:01:33" (1/3) ... [2024-10-11 10:01:37,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2285b8c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:01:37, skipping insertion in model container [2024-10-11 10:01:37,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:01:34" (2/3) ... [2024-10-11 10:01:37,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2285b8c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:01:37, skipping insertion in model container [2024-10-11 10:01:37,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:01:37" (3/3) ... [2024-10-11 10:01:37,957 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-40.i [2024-10-11 10:01:37,970 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:01:37,971 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:01:38,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:01:38,022 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;@2dad957d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:01:38,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:01:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 44 states have internal predecessors, (66), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:01:38,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 10:01:38,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:01:38,039 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:01:38,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:01:38,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:01:38,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1812594532, now seen corresponding path program 1 times [2024-10-11 10:01:38,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:01:38,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106199544] [2024-10-11 10:01:38,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:01:38,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:01:38,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:01:38,074 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:01:38,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 10:01:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:38,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:01:38,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:01:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-10-11 10:01:38,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:01:38,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:01:38,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106199544] [2024-10-11 10:01:38,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106199544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:01:38,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:01:38,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:01:38,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709176440] [2024-10-11 10:01:38,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:01:38,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:01:38,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:01:38,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:01:38,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:01:38,497 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 44 states have internal predecessors, (66), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 10:01:38,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:01:38,684 INFO L93 Difference]: Finished difference Result 125 states and 220 transitions. [2024-10-11 10:01:38,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:01:38,698 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 123 [2024-10-11 10:01:38,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:01:38,706 INFO L225 Difference]: With dead ends: 125 [2024-10-11 10:01:38,706 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 10:01:38,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:01:38,714 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:01:38,715 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.2s Time] [2024-10-11 10:01:38,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 10:01:38,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 10:01:38,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 42 states have internal predecessors, (60), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:01:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 96 transitions. [2024-10-11 10:01:38,759 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 96 transitions. Word has length 123 [2024-10-11 10:01:38,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:01:38,759 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 96 transitions. [2024-10-11 10:01:38,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 10:01:38,760 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 96 transitions. [2024-10-11 10:01:38,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 10:01:38,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:01:38,762 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:01:38,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 10:01:38,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:01:38,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:01:38,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:01:38,967 INFO L85 PathProgramCache]: Analyzing trace with hash -38676952, now seen corresponding path program 1 times [2024-10-11 10:01:38,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:01:38,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080883218] [2024-10-11 10:01:38,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:01:38,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:01:38,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:01:38,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:01:38,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 10:01:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:39,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 10:01:39,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:01:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 321 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 10:01:39,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:01:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-11 10:01:40,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:01:40,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080883218] [2024-10-11 10:01:40,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080883218] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:01:40,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:01:40,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-11 10:01:40,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933879787] [2024-10-11 10:01:40,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:01:40,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 10:01:40,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:01:40,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 10:01:40,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:01:40,073 INFO L87 Difference]: Start difference. First operand 62 states and 96 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 10:01:40,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:01:40,691 INFO L93 Difference]: Finished difference Result 129 states and 194 transitions. [2024-10-11 10:01:40,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:01:40,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 124 [2024-10-11 10:01:40,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:01:40,701 INFO L225 Difference]: With dead ends: 129 [2024-10-11 10:01:40,701 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 10:01:40,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:01:40,703 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:01:40,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 137 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 10:01:40,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 10:01:40,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2024-10-11 10:01:40,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:01:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2024-10-11 10:01:40,714 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 124 [2024-10-11 10:01:40,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:01:40,714 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2024-10-11 10:01:40,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 10:01:40,714 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2024-10-11 10:01:40,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 10:01:40,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:01:40,716 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:01:40,727 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 10:01:40,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:01:40,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:01:40,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:01:40,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1249352412, now seen corresponding path program 1 times [2024-10-11 10:01:40,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:01:40,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395875383] [2024-10-11 10:01:40,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:01:40,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:01:40,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:01:40,924 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:01:40,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 10:01:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:41,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 10:01:41,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:01:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:01:41,282 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:01:41,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:01:41,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395875383] [2024-10-11 10:01:41,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395875383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:01:41,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:01:41,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:01:41,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413875351] [2024-10-11 10:01:41,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:01:41,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:01:41,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:01:41,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:01:41,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:01:41,284 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:01:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:01:41,449 INFO L93 Difference]: Finished difference Result 127 states and 181 transitions. [2024-10-11 10:01:41,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:01:41,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2024-10-11 10:01:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:01:41,463 INFO L225 Difference]: With dead ends: 127 [2024-10-11 10:01:41,463 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 10:01:41,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:01:41,465 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:01:41,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:01:41,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 10:01:41,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 10:01:41,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:01:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2024-10-11 10:01:41,473 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 124 [2024-10-11 10:01:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:01:41,473 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2024-10-11 10:01:41,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:01:41,474 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2024-10-11 10:01:41,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 10:01:41,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:01:41,475 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:01:41,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 10:01:41,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:01:41,680 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:01:41,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:01:41,680 INFO L85 PathProgramCache]: Analyzing trace with hash 525654950, now seen corresponding path program 1 times [2024-10-11 10:01:41,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:01:41,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439401722] [2024-10-11 10:01:41,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:01:41,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:01:41,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:01:41,684 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:01:41,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 10:01:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:42,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 10:01:42,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:01:42,424 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:01:42,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:01:42,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:01:42,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439401722] [2024-10-11 10:01:42,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439401722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:01:42,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:01:42,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:01:42,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283791446] [2024-10-11 10:01:42,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:01:42,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:01:42,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:01:42,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:01:42,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:01:42,426 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:01:43,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:01:43,548 INFO L93 Difference]: Finished difference Result 237 states and 334 transitions. [2024-10-11 10:01:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 10:01:43,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2024-10-11 10:01:43,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:01:43,552 INFO L225 Difference]: With dead ends: 237 [2024-10-11 10:01:43,552 INFO L226 Difference]: Without dead ends: 174 [2024-10-11 10:01:43,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:01:43,556 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 149 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:01:43,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 346 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 10:01:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-11 10:01:43,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 104. [2024-10-11 10:01:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 63 states have internal predecessors, (73), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 10:01:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 145 transitions. [2024-10-11 10:01:43,581 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 145 transitions. Word has length 124 [2024-10-11 10:01:43,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:01:43,582 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 145 transitions. [2024-10-11 10:01:43,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:01:43,582 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 145 transitions. [2024-10-11 10:01:43,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 10:01:43,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:01:43,584 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:01:43,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 10:01:43,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:01:43,788 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:01:43,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:01:43,788 INFO L85 PathProgramCache]: Analyzing trace with hash 525714532, now seen corresponding path program 1 times [2024-10-11 10:01:43,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:01:43,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687675652] [2024-10-11 10:01:43,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:01:43,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:01:43,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:01:43,795 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:01:43,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 10:01:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:44,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 10:01:44,116 INFO L278 TraceCheckSpWp]: Computing forward predicates...