./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_codestructure_dependencies_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-53.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa617a5ca77fc3b001e2a60d9350ce82cdfb1a774bde80f37c22028b912f277d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:51:02,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:51:02,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 23:51:02,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:51:02,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:51:02,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:51:02,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:51:02,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:51:02,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:51:02,127 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:51:02,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:51:02,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:51:02,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:51:02,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:51:02,129 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:51:02,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:51:02,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:51:02,130 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 23:51:02,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:51:02,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 23:51:02,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:51:02,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:51:02,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:51:02,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:51:02,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:51:02,132 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 23:51:02,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:51:02,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:51:02,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:51:02,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:51:02,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:51:02,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:51:02,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:51:02,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:51:02,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:51:02,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:51:02,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:51:02,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:51:02,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:51:02,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:51:02,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:51:02,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:51:02,137 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa617a5ca77fc3b001e2a60d9350ce82cdfb1a774bde80f37c22028b912f277d [2024-10-12 23:51:02,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:51:02,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:51:02,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:51:02,394 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:51:02,394 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:51:02,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-53.i [2024-10-12 23:51:03,854 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:51:04,062 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:51:04,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-53.i [2024-10-12 23:51:04,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8bcf61fd/02d08ae7c50c482784b172e83e35390e/FLAGc46d0298b [2024-10-12 23:51:04,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8bcf61fd/02d08ae7c50c482784b172e83e35390e [2024-10-12 23:51:04,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:51:04,091 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:51:04,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:51:04,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:51:04,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:51:04,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:51:04" (1/1) ... [2024-10-12 23:51:04,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@698f4ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:04, skipping insertion in model container [2024-10-12 23:51:04,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:51:04" (1/1) ... [2024-10-12 23:51:04,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:51:04,318 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_codestructure_dependencies_file-53.i[919,932] [2024-10-12 23:51:04,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:51:04,406 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:51:04,418 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_codestructure_dependencies_file-53.i[919,932] [2024-10-12 23:51:04,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:51:04,483 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:51:04,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:04 WrapperNode [2024-10-12 23:51:04,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:51:04,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:51:04,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:51:04,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:51:04,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:04" (1/1) ... [2024-10-12 23:51:04,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:04" (1/1) ... [2024-10-12 23:51:04,543 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-10-12 23:51:04,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:51:04,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:51:04,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:51:04,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:51:04,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:04" (1/1) ... [2024-10-12 23:51:04,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:04" (1/1) ... [2024-10-12 23:51:04,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:04" (1/1) ... [2024-10-12 23:51:04,584 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-12 23:51:04,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:04" (1/1) ... [2024-10-12 23:51:04,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:04" (1/1) ... [2024-10-12 23:51:04,617 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:04" (1/1) ... [2024-10-12 23:51:04,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:04" (1/1) ... [2024-10-12 23:51:04,630 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:04" (1/1) ... [2024-10-12 23:51:04,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:04" (1/1) ... [2024-10-12 23:51:04,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:51:04,636 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:51:04,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:51:04,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:51:04,641 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:04" (1/1) ... [2024-10-12 23:51:04,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:51:04,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:51:04,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:51:04,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:51:04,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:51:04,760 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 23:51:04,761 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 23:51:04,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:51:04,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:51:04,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:51:04,851 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:51:04,853 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:51:05,214 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-12 23:51:05,214 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:51:05,249 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:51:05,249 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:51:05,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:51:05 BoogieIcfgContainer [2024-10-12 23:51:05,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:51:05,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:51:05,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:51:05,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:51:05,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:51:04" (1/3) ... [2024-10-12 23:51:05,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5db06f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:51:05, skipping insertion in model container [2024-10-12 23:51:05,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:04" (2/3) ... [2024-10-12 23:51:05,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5db06f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:51:05, skipping insertion in model container [2024-10-12 23:51:05,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:51:05" (3/3) ... [2024-10-12 23:51:05,258 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-53.i [2024-10-12 23:51:05,274 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:51:05,275 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:51:05,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:51:05,344 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;@234bac37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:51:05,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:51:05,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 48 states have internal predecessors, (70), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-12 23:51:05,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-12 23:51:05,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:05,361 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:51:05,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:05,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:05,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1693379352, now seen corresponding path program 1 times [2024-10-12 23:51:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:51:05,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411370162] [2024-10-12 23:51:05,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:05,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:51:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:05,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:51:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:05,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:51:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:05,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:51:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:05,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 23:51:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:05,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 23:51:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:05,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 23:51:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:05,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 23:51:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:05,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 23:51:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:05,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 23:51:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:05,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 23:51:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:05,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:51:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:05,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:51:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:05,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:51:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:05,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:51:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:05,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:51:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:05,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 23:51:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:05,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 23:51:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:51:05,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:51:05,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411370162] [2024-10-12 23:51:05,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411370162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:51:05,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:51:05,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:51:05,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146126370] [2024-10-12 23:51:05,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:51:05,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 23:51:05,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:51:05,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 23:51:05,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:51:05,760 INFO L87 Difference]: Start difference. First operand has 67 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 48 states have internal predecessors, (70), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 23:51:05,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:51:05,792 INFO L93 Difference]: Finished difference Result 131 states and 223 transitions. [2024-10-12 23:51:05,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 23:51:05,795 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 110 [2024-10-12 23:51:05,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:51:05,801 INFO L225 Difference]: With dead ends: 131 [2024-10-12 23:51:05,801 INFO L226 Difference]: Without dead ends: 65 [2024-10-12 23:51:05,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-12 23:51:05,808 INFO L432 NwaCegarLoop]: 96 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, 96 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-12 23:51:05,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:51:05,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-12 23:51:05,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-12 23:51:05,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 46 states have internal predecessors, (65), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-12 23:51:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 99 transitions. [2024-10-12 23:51:05,855 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 99 transitions. Word has length 110 [2024-10-12 23:51:05,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:05,856 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 99 transitions. [2024-10-12 23:51:05,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 23:51:05,856 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 99 transitions. [2024-10-12 23:51:05,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-12 23:51:05,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:05,860 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:51:05,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:51:05,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:05,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:05,862 INFO L85 PathProgramCache]: Analyzing trace with hash 597431154, now seen corresponding path program 1 times [2024-10-12 23:51:05,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:51:05,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331240378] [2024-10-12 23:51:05,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:05,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:51:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:51:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:51:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:51:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 23:51:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 23:51:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 23:51:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 23:51:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 23:51:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 23:51:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 23:51:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:51:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:51:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:51:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:51:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:51:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 23:51:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 23:51:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,195 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:51:06,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:51:06,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331240378] [2024-10-12 23:51:06,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331240378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:51:06,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:51:06,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:51:06,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359551275] [2024-10-12 23:51:06,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:51:06,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 23:51:06,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:51:06,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 23:51:06,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:51:06,207 INFO L87 Difference]: Start difference. First operand 65 states and 99 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:51:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:51:06,291 INFO L93 Difference]: Finished difference Result 184 states and 280 transitions. [2024-10-12 23:51:06,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:51:06,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2024-10-12 23:51:06,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:51:06,295 INFO L225 Difference]: With dead ends: 184 [2024-10-12 23:51:06,297 INFO L226 Difference]: Without dead ends: 120 [2024-10-12 23:51:06,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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-12 23:51:06,299 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 79 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:51:06,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 233 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:51:06,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-12 23:51:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2024-10-12 23:51:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 23:51:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 178 transitions. [2024-10-12 23:51:06,339 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 178 transitions. Word has length 110 [2024-10-12 23:51:06,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:06,340 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 178 transitions. [2024-10-12 23:51:06,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:51:06,340 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 178 transitions. [2024-10-12 23:51:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 23:51:06,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:06,344 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:51:06,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 23:51:06,344 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:06,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:06,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1478551692, now seen corresponding path program 1 times [2024-10-12 23:51:06,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:51:06,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751373149] [2024-10-12 23:51:06,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:06,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:51:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:51:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:51:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:51:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 23:51:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 23:51:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 23:51:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 23:51:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 23:51:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 23:51:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 23:51:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:51:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:51:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:51:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:51:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:51:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 23:51:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 23:51:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:51:06,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:51:06,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751373149] [2024-10-12 23:51:06,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751373149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:51:06,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:51:06,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:51:06,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484776920] [2024-10-12 23:51:06,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:51:06,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:51:06,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:51:06,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:51:06,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:51:06,712 INFO L87 Difference]: Start difference. First operand 118 states and 178 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:51:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:51:06,946 INFO L93 Difference]: Finished difference Result 399 states and 599 transitions. [2024-10-12 23:51:06,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:51:06,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2024-10-12 23:51:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:51:06,953 INFO L225 Difference]: With dead ends: 399 [2024-10-12 23:51:06,956 INFO L226 Difference]: Without dead ends: 282 [2024-10-12 23:51:06,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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-12 23:51:06,959 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 111 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:51:06,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 279 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:51:06,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-12 23:51:07,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 266. [2024-10-12 23:51:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 193 states have (on average 1.3575129533678756) internal successors, (262), 193 states have internal predecessors, (262), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-12 23:51:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 398 transitions. [2024-10-12 23:51:07,018 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 398 transitions. Word has length 111 [2024-10-12 23:51:07,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:07,018 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 398 transitions. [2024-10-12 23:51:07,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:51:07,019 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 398 transitions. [2024-10-12 23:51:07,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 23:51:07,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:07,023 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:51:07,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 23:51:07,024 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:07,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:07,024 INFO L85 PathProgramCache]: Analyzing trace with hash 804926292, now seen corresponding path program 1 times [2024-10-12 23:51:07,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:51:07,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774369410] [2024-10-12 23:51:07,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:07,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:51:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:51:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:51:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:51:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 23:51:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 23:51:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 23:51:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 23:51:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 23:51:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 23:51:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 23:51:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:51:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:51:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:51:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:51:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:51:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 23:51:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 23:51:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:51:07,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:51:07,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774369410] [2024-10-12 23:51:07,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774369410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:51:07,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:51:07,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:51:07,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641036014] [2024-10-12 23:51:07,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:51:07,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 23:51:07,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:51:07,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 23:51:07,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:51:07,289 INFO L87 Difference]: Start difference. First operand 266 states and 398 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:51:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:51:07,366 INFO L93 Difference]: Finished difference Result 675 states and 1015 transitions. [2024-10-12 23:51:07,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:51:07,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 112 [2024-10-12 23:51:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:51:07,371 INFO L225 Difference]: With dead ends: 675 [2024-10-12 23:51:07,371 INFO L226 Difference]: Without dead ends: 410 [2024-10-12 23:51:07,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-12 23:51:07,374 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 59 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:51:07,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 180 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:51:07,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-10-12 23:51:07,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2024-10-12 23:51:07,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 299 states have (on average 1.351170568561873) internal successors, (404), 299 states have internal predecessors, (404), 102 states have call successors, (102), 6 states have call predecessors, (102), 6 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-12 23:51:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 608 transitions. [2024-10-12 23:51:07,432 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 608 transitions. Word has length 112 [2024-10-12 23:51:07,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:07,433 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 608 transitions. [2024-10-12 23:51:07,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:51:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 608 transitions. [2024-10-12 23:51:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 23:51:07,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:07,436 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:51:07,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 23:51:07,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:07,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:07,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1761225088, now seen corresponding path program 1 times [2024-10-12 23:51:07,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:51:07,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153359078] [2024-10-12 23:51:07,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:07,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:51:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:51:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:51:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:51:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 23:51:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 23:51:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 23:51:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 23:51:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 23:51:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 23:51:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 23:51:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:51:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:51:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:51:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:51:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:51:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 23:51:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 23:51:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,567 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:51:07,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:51:07,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153359078] [2024-10-12 23:51:07,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153359078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:51:07,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:51:07,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:51:07,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886711476] [2024-10-12 23:51:07,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:51:07,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 23:51:07,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:51:07,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 23:51:07,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:51:07,572 INFO L87 Difference]: Start difference. First operand 408 states and 608 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:51:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:51:07,701 INFO L93 Difference]: Finished difference Result 1189 states and 1774 transitions. [2024-10-12 23:51:07,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:51:07,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 113 [2024-10-12 23:51:07,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:51:07,709 INFO L225 Difference]: With dead ends: 1189 [2024-10-12 23:51:07,709 INFO L226 Difference]: Without dead ends: 782 [2024-10-12 23:51:07,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-12 23:51:07,712 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 93 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:51:07,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 246 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:51:07,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-10-12 23:51:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 414. [2024-10-12 23:51:07,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 305 states have (on average 1.3442622950819672) internal successors, (410), 305 states have internal predecessors, (410), 102 states have call successors, (102), 6 states have call predecessors, (102), 6 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-12 23:51:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 614 transitions. [2024-10-12 23:51:07,769 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 614 transitions. Word has length 113 [2024-10-12 23:51:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:07,769 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 614 transitions. [2024-10-12 23:51:07,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:51:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 614 transitions. [2024-10-12 23:51:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 23:51:07,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:07,771 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:51:07,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 23:51:07,771 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:07,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:07,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1081166718, now seen corresponding path program 1 times [2024-10-12 23:51:07,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:51:07,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257592800] [2024-10-12 23:51:07,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:07,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:51:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:07,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:51:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:08,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:51:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:08,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:51:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:08,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 23:51:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:08,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 23:51:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:08,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 23:51:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:08,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 23:51:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:08,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 23:51:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:08,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 23:51:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:08,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 23:51:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:08,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:51:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:08,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:51:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:08,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:51:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:08,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:51:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:08,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:51:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:08,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 23:51:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:08,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 23:51:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:08,053 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-12 23:51:08,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:51:08,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257592800] [2024-10-12 23:51:08,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257592800] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:51:08,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259081132] [2024-10-12 23:51:08,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:08,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:51:08,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:51:08,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:51:08,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 23:51:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:08,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 23:51:08,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:51:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 106 proven. 3 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-12 23:51:08,278 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:51:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-12 23:51:08,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259081132] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:51:08,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:51:08,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-10-12 23:51:08,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383006586] [2024-10-12 23:51:08,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:51:08,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 23:51:08,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:51:08,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 23:51:08,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:51:08,460 INFO L87 Difference]: Start difference. First operand 414 states and 614 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-12 23:51:09,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:51:09,018 INFO L93 Difference]: Finished difference Result 1285 states and 1862 transitions. [2024-10-12 23:51:09,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 23:51:09,019 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 113 [2024-10-12 23:51:09,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:51:09,024 INFO L225 Difference]: With dead ends: 1285 [2024-10-12 23:51:09,024 INFO L226 Difference]: Without dead ends: 872 [2024-10-12 23:51:09,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 255 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2024-10-12 23:51:09,027 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 180 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 23:51:09,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 457 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 23:51:09,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-12 23:51:09,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 432. [2024-10-12 23:51:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 317 states have (on average 1.3123028391167193) internal successors, (416), 317 states have internal predecessors, (416), 102 states have call successors, (102), 12 states have call predecessors, (102), 12 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-12 23:51:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 620 transitions. [2024-10-12 23:51:09,097 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 620 transitions. Word has length 113 [2024-10-12 23:51:09,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:09,097 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 620 transitions. [2024-10-12 23:51:09,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-12 23:51:09,098 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 620 transitions. [2024-10-12 23:51:09,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 23:51:09,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:09,099 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:51:09,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 23:51:09,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-12 23:51:09,300 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:09,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:09,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1729944596, now seen corresponding path program 1 times [2024-10-12 23:51:09,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:51:09,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931437680] [2024-10-12 23:51:09,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:09,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:51:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:09,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:51:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:09,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:51:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:09,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:51:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:09,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 23:51:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:09,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 23:51:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:09,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 23:51:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:09,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 23:51:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:09,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 23:51:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:09,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 23:51:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:09,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 23:51:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:09,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:51:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:09,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:51:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:09,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:51:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:09,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:51:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:09,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:51:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:09,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 23:51:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:09,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 23:51:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:51:09,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:51:09,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931437680] [2024-10-12 23:51:09,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931437680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:51:09,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:51:09,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:51:09,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219685001] [2024-10-12 23:51:09,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:51:09,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:51:09,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:51:09,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:51:09,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:51:09,497 INFO L87 Difference]: Start difference. First operand 432 states and 620 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:51:09,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:51:09,593 INFO L93 Difference]: Finished difference Result 434 states and 621 transitions. [2024-10-12 23:51:09,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:51:09,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 113 [2024-10-12 23:51:09,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:51:09,596 INFO L225 Difference]: With dead ends: 434 [2024-10-12 23:51:09,596 INFO L226 Difference]: Without dead ends: 153 [2024-10-12 23:51:09,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-12 23:51:09,598 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:51:09,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 83 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:51:09,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-12 23:51:09,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-10-12 23:51:09,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 114 states have (on average 1.2719298245614035) internal successors, (145), 114 states have internal predecessors, (145), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 23:51:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 213 transitions. [2024-10-12 23:51:09,639 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 213 transitions. Word has length 113 [2024-10-12 23:51:09,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:09,639 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 213 transitions. [2024-10-12 23:51:09,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:51:09,639 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 213 transitions. [2024-10-12 23:51:09,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-12 23:51:09,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:09,641 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:51:09,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 23:51:09,642 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:09,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:09,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1582451162, now seen corresponding path program 1 times [2024-10-12 23:51:09,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:51:09,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103893180] [2024-10-12 23:51:09,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:09,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:51:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 23:51:09,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1985334522] [2024-10-12 23:51:09,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:09,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:51:09,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:51:09,727 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:51:09,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 23:51:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:51:09,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:51:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:51:10,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 23:51:10,104 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:51:10,105 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:51:10,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 23:51:10,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-12 23:51:10,311 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:51:10,414 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:51:10,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:51:10 BoogieIcfgContainer [2024-10-12 23:51:10,417 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:51:10,418 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:51:10,418 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:51:10,418 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:51:10,419 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:51:05" (3/4) ... [2024-10-12 23:51:10,420 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 23:51:10,421 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:51:10,422 INFO L158 Benchmark]: Toolchain (without parser) took 6331.32ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 107.3MB in the beginning and 136.0MB in the end (delta: -28.7MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-10-12 23:51:10,422 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 72.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:51:10,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.48ms. Allocated memory is still 176.2MB. Free memory was 107.0MB in the beginning and 91.9MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 23:51:10,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.89ms. Allocated memory is still 176.2MB. Free memory was 91.9MB in the beginning and 88.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 23:51:10,423 INFO L158 Benchmark]: Boogie Preprocessor took 89.90ms. Allocated memory is still 176.2MB. Free memory was 88.6MB in the beginning and 147.3MB in the end (delta: -58.7MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-10-12 23:51:10,423 INFO L158 Benchmark]: RCFGBuilder took 614.22ms. Allocated memory is still 176.2MB. Free memory was 146.6MB in the beginning and 121.8MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 23:51:10,423 INFO L158 Benchmark]: TraceAbstraction took 5165.12ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 121.1MB in the beginning and 136.0MB in the end (delta: -14.9MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2024-10-12 23:51:10,424 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 213.9MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:51:10,425 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 72.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.48ms. Allocated memory is still 176.2MB. Free memory was 107.0MB in the beginning and 91.9MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.89ms. Allocated memory is still 176.2MB. Free memory was 91.9MB in the beginning and 88.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.90ms. Allocated memory is still 176.2MB. Free memory was 88.6MB in the beginning and 147.3MB in the end (delta: -58.7MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * RCFGBuilder took 614.22ms. Allocated memory is still 176.2MB. Free memory was 146.6MB in the beginning and 121.8MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5165.12ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 121.1MB in the beginning and 136.0MB in the end (delta: -14.9MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 213.9MB. Free memory is still 136.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 118, overapproximation of shiftLeft at line 52, overapproximation of someBinaryArithmeticFLOAToperation at line 56, overapproximation of someUnaryFLOAToperation at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_8 = 0; [L24] unsigned long int var_1_9 = 10; [L25] float var_1_10 = 99.5; [L26] float var_1_11 = 5.6; [L27] float var_1_12 = 255.5; [L28] float var_1_13 = 31.25; [L29] signed short int var_1_14 = 32; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_16 = 1; [L32] unsigned char var_1_17 = 5; [L33] unsigned char var_1_18 = 50; [L34] unsigned char var_1_19 = 50; [L35] signed char var_1_20 = 1; [L36] signed char var_1_21 = -10; [L37] float var_1_22 = 0.5; [L38] signed char var_1_23 = 100; [L39] unsigned char last_1_var_1_1 = 0; [L40] unsigned long int last_1_var_1_9 = 10; [L41] signed short int last_1_var_1_14 = 32; [L42] unsigned char last_1_var_1_16 = 1; [L43] signed char last_1_var_1_20 = 1; [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L111] last_1_var_1_1 = var_1_1 [L112] last_1_var_1_9 = var_1_9 [L113] last_1_var_1_14 = var_1_14 [L114] last_1_var_1_16 = var_1_16 [L115] last_1_var_1_20 = var_1_20 [L125] RET updateLastVariables() [L126] CALL updateVariables() [L83] var_1_8 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L84] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L85] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L85] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L86] var_1_11 = __VERIFIER_nondet_float() [L87] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L87] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L88] var_1_12 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L89] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L90] var_1_13 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L91] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L92] var_1_15 = __VERIFIER_nondet_ulong() [L93] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L93] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L94] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L94] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L95] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L95] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L96] var_1_17 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L97] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L98] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L98] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L99] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L99] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L100] var_1_18 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L101] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L102] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L102] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L103] var_1_19 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L104] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L105] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L105] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L106] var_1_21 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L107] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L108] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L108] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L126] RET updateVariables() [L127] CALL step() [L47] COND FALSE !((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L52] EXPR 256u << last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L52] COND TRUE (((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16) [L53] var_1_16 = ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=6, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L55] COND TRUE (! var_1_1) || var_1_8 [L56] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=6, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L64] var_1_20 = var_1_21 [L65] var_1_22 = var_1_12 [L66] var_1_23 = var_1_21 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=6, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L67] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=6, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L70] EXPR (var_1_16 / var_1_15) & var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=6, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L70] COND TRUE ((var_1_16 / var_1_15) & var_1_16) >= var_1_20 [L71] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=6, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L76] COND TRUE (var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=6, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L77] COND TRUE ((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16) [L78] var_1_9 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=6, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=5] [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR (((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=6, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=5] [L118] EXPR ((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=6, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=5] [L118-L119] return (((((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=6, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=6, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 8, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 627 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 625 mSDsluCounter, 1574 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 726 mSDsCounter, 215 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 499 IncrementalHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 215 mSolverCounterUnsat, 848 mSDtfsCounter, 499 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 523 GetRequests, 491 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=432occurred in iteration=6, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 828 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1123 NumberOfCodeBlocks, 1123 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 999 ConstructedInterpolants, 0 QuantifiedInterpolants, 1404 SizeOfPredicates, 3 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 4887/4896 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-12 23:51:10,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-53.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa617a5ca77fc3b001e2a60d9350ce82cdfb1a774bde80f37c22028b912f277d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:51:12,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:51:12,729 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-12 23:51:12,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:51:12,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:51:12,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:51:12,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:51:12,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:51:12,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:51:12,766 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:51:12,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:51:12,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:51:12,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:51:12,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:51:12,770 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:51:12,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:51:12,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:51:12,772 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 23:51:12,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 23:51:12,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:51:12,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:51:12,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:51:12,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:51:12,777 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 23:51:12,777 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 23:51:12,777 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:51:12,777 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 23:51:12,777 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 23:51:12,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:51:12,778 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:51:12,780 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:51:12,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:51:12,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:51:12,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:51:12,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:51:12,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:51:12,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:51:12,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:51:12,782 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 23:51:12,782 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 23:51:12,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:51:12,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:51:12,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:51:12,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:51:12,783 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 23:51:12,783 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa617a5ca77fc3b001e2a60d9350ce82cdfb1a774bde80f37c22028b912f277d [2024-10-12 23:51:13,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:51:13,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:51:13,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:51:13,113 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:51:13,114 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:51:13,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-53.i [2024-10-12 23:51:14,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:51:14,803 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:51:14,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-53.i [2024-10-12 23:51:14,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9950e4176/df028f40e40d40e68dbe2e170e360d90/FLAG7112620a5 [2024-10-12 23:51:15,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9950e4176/df028f40e40d40e68dbe2e170e360d90 [2024-10-12 23:51:15,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:51:15,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:51:15,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:51:15,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:51:15,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:51:15,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:51:15" (1/1) ... [2024-10-12 23:51:15,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd08b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:15, skipping insertion in model container [2024-10-12 23:51:15,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:51:15" (1/1) ... [2024-10-12 23:51:15,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:51:15,379 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_codestructure_dependencies_file-53.i[919,932] [2024-10-12 23:51:15,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:51:15,461 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:51:15,477 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_codestructure_dependencies_file-53.i[919,932] [2024-10-12 23:51:15,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:51:15,515 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:51:15,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:15 WrapperNode [2024-10-12 23:51:15,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:51:15,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:51:15,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:51:15,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:51:15,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:15" (1/1) ... [2024-10-12 23:51:15,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:15" (1/1) ... [2024-10-12 23:51:15,562 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-10-12 23:51:15,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:51:15,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:51:15,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:51:15,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:51:15,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:15" (1/1) ... [2024-10-12 23:51:15,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:15" (1/1) ... [2024-10-12 23:51:15,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:15" (1/1) ... [2024-10-12 23:51:15,592 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-12 23:51:15,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:15" (1/1) ... [2024-10-12 23:51:15,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:15" (1/1) ... [2024-10-12 23:51:15,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:15" (1/1) ... [2024-10-12 23:51:15,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:15" (1/1) ... [2024-10-12 23:51:15,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:15" (1/1) ... [2024-10-12 23:51:15,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:15" (1/1) ... [2024-10-12 23:51:15,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:51:15,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:51:15,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:51:15,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:51:15,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:15" (1/1) ... [2024-10-12 23:51:15,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:51:15,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:51:15,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:51:15,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:51:15,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:51:15,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 23:51:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 23:51:15,704 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 23:51:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:51:15,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:51:15,789 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:51:15,791 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:51:16,429 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-12 23:51:16,430 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:51:16,492 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:51:16,492 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:51:16,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:51:16 BoogieIcfgContainer [2024-10-12 23:51:16,493 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:51:16,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:51:16,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:51:16,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:51:16,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:51:15" (1/3) ... [2024-10-12 23:51:16,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99f4a06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:51:16, skipping insertion in model container [2024-10-12 23:51:16,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:51:15" (2/3) ... [2024-10-12 23:51:16,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99f4a06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:51:16, skipping insertion in model container [2024-10-12 23:51:16,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:51:16" (3/3) ... [2024-10-12 23:51:16,504 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-53.i [2024-10-12 23:51:16,520 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:51:16,520 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:51:16,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:51:16,611 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;@76201b81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:51:16,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:51:16,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 30 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-12 23:51:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 23:51:16,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:16,630 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:51:16,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:16,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:16,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1678089336, now seen corresponding path program 1 times [2024-10-12 23:51:16,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:51:16,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300755942] [2024-10-12 23:51:16,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:16,648 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-12 23:51:16,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:51:16,650 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:51:16,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 23:51:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:16,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 23:51:16,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:51:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-12 23:51:16,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:51:16,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:51:16,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300755942] [2024-10-12 23:51:16,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300755942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:51:16,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:51:16,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:51:16,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542654946] [2024-10-12 23:51:16,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:51:16,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 23:51:16,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:51:16,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 23:51:16,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:51:16,972 INFO L87 Difference]: Start difference. First operand has 49 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 30 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 23:51:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:51:17,098 INFO L93 Difference]: Finished difference Result 95 states and 169 transitions. [2024-10-12 23:51:17,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 23:51:17,109 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 105 [2024-10-12 23:51:17,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:51:17,119 INFO L225 Difference]: With dead ends: 95 [2024-10-12 23:51:17,119 INFO L226 Difference]: Without dead ends: 47 [2024-10-12 23:51:17,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-12 23:51:17,125 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:51:17,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:51:17,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-12 23:51:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-12 23:51:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-12 23:51:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 72 transitions. [2024-10-12 23:51:17,164 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 72 transitions. Word has length 105 [2024-10-12 23:51:17,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:17,165 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 72 transitions. [2024-10-12 23:51:17,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 23:51:17,165 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 72 transitions. [2024-10-12 23:51:17,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 23:51:17,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:17,168 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:51:17,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-12 23:51:17,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:51:17,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:17,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:17,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1320744638, now seen corresponding path program 1 times [2024-10-12 23:51:17,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:51:17,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602098211] [2024-10-12 23:51:17,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:17,371 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-12 23:51:17,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:51:17,386 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:51:17,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-12 23:51:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:17,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 23:51:17,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:51:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:51:17,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:51:17,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:51:17,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602098211] [2024-10-12 23:51:17,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602098211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:51:17,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:51:17,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:51:17,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303201923] [2024-10-12 23:51:17,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:51:17,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 23:51:17,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:51:17,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 23:51:17,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:51:17,644 INFO L87 Difference]: Start difference. First operand 47 states and 72 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:51:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:51:17,965 INFO L93 Difference]: Finished difference Result 137 states and 210 transitions. [2024-10-12 23:51:17,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:51:17,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2024-10-12 23:51:17,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:51:17,971 INFO L225 Difference]: With dead ends: 137 [2024-10-12 23:51:17,971 INFO L226 Difference]: Without dead ends: 91 [2024-10-12 23:51:17,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 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-12 23:51:17,973 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 64 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 23:51:17,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 181 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 23:51:17,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-12 23:51:18,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2024-10-12 23:51:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 23:51:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 136 transitions. [2024-10-12 23:51:18,009 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 136 transitions. Word has length 105 [2024-10-12 23:51:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:18,009 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 136 transitions. [2024-10-12 23:51:18,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:51:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 136 transitions. [2024-10-12 23:51:18,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 23:51:18,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:18,011 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:51:18,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-12 23:51:18,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:51:18,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:18,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash -2016151091, now seen corresponding path program 1 times [2024-10-12 23:51:18,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:51:18,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026385273] [2024-10-12 23:51:18,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:18,214 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-12 23:51:18,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:51:18,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:51:18,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-12 23:51:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 23:51:18,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:51:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:51:18,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:51:18,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:51:18,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026385273] [2024-10-12 23:51:18,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026385273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:51:18,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:51:18,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:51:18,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678798547] [2024-10-12 23:51:18,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:51:18,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 23:51:18,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:51:18,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 23:51:18,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:51:18,719 INFO L87 Difference]: Start difference. First operand 89 states and 136 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:51:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:51:19,121 INFO L93 Difference]: Finished difference Result 183 states and 279 transitions. [2024-10-12 23:51:19,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:51:19,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 106 [2024-10-12 23:51:19,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:51:19,124 INFO L225 Difference]: With dead ends: 183 [2024-10-12 23:51:19,124 INFO L226 Difference]: Without dead ends: 95 [2024-10-12 23:51:19,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 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-12 23:51:19,128 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 23:51:19,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 125 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 23:51:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-12 23:51:19,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-10-12 23:51:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 23:51:19,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 141 transitions. [2024-10-12 23:51:19,148 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 141 transitions. Word has length 106 [2024-10-12 23:51:19,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:19,150 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 141 transitions. [2024-10-12 23:51:19,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:51:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 141 transitions. [2024-10-12 23:51:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 23:51:19,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:19,156 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:51:19,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-12 23:51:19,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:51:19,357 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:19,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:19,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1964284960, now seen corresponding path program 1 times [2024-10-12 23:51:19,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:51:19,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337373624] [2024-10-12 23:51:19,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:19,359 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-12 23:51:19,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:51:19,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:51:19,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-12 23:51:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:19,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 23:51:19,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:51:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 23:51:19,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:51:19,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:51:19,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337373624] [2024-10-12 23:51:19,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337373624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:51:19,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:51:19,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:51:19,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144863867] [2024-10-12 23:51:19,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:51:19,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 23:51:19,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:51:19,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 23:51:19,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:51:19,635 INFO L87 Difference]: Start difference. First operand 93 states and 141 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:51:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:51:19,913 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2024-10-12 23:51:19,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:51:19,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 106 [2024-10-12 23:51:19,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:51:19,917 INFO L225 Difference]: With dead ends: 237 [2024-10-12 23:51:19,917 INFO L226 Difference]: Without dead ends: 145 [2024-10-12 23:51:19,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 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-12 23:51:19,919 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 66 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:51:19,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 189 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:51:19,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-12 23:51:19,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 94. [2024-10-12 23:51:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 23:51:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 142 transitions. [2024-10-12 23:51:19,945 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 142 transitions. Word has length 106 [2024-10-12 23:51:19,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:19,946 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 142 transitions. [2024-10-12 23:51:19,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-12 23:51:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 142 transitions. [2024-10-12 23:51:19,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 23:51:19,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:19,948 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:51:19,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-12 23:51:20,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:51:20,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:20,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:20,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1962437918, now seen corresponding path program 1 times [2024-10-12 23:51:20,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:51:20,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576872120] [2024-10-12 23:51:20,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:20,150 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-12 23:51:20,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:51:20,153 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:51:20,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-12 23:51:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:20,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 23:51:20,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:51:20,464 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 106 proven. 3 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-12 23:51:20,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:51:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-12 23:51:20,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:51:20,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576872120] [2024-10-12 23:51:20,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576872120] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:51:20,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:51:20,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-10-12 23:51:20,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640860159] [2024-10-12 23:51:20,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 23:51:20,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 23:51:20,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:51:20,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 23:51:20,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:51:20,704 INFO L87 Difference]: Start difference. First operand 94 states and 142 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-12 23:51:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:51:22,059 INFO L93 Difference]: Finished difference Result 303 states and 442 transitions. [2024-10-12 23:51:22,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-12 23:51:22,062 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 106 [2024-10-12 23:51:22,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:51:22,065 INFO L225 Difference]: With dead ends: 303 [2024-10-12 23:51:22,065 INFO L226 Difference]: Without dead ends: 210 [2024-10-12 23:51:22,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=249, Invalid=563, Unknown=0, NotChecked=0, Total=812 [2024-10-12 23:51:22,067 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 171 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:51:22,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 260 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 23:51:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-12 23:51:22,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 101. [2024-10-12 23:51:22,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 62 states have internal predecessors, (78), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 23:51:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2024-10-12 23:51:22,103 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 106 [2024-10-12 23:51:22,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:22,103 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2024-10-12 23:51:22,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-12 23:51:22,104 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2024-10-12 23:51:22,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 23:51:22,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:22,110 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:51:22,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-12 23:51:22,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:51:22,311 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:22,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash -772853525, now seen corresponding path program 1 times [2024-10-12 23:51:22,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:51:22,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160661994] [2024-10-12 23:51:22,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:22,312 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-12 23:51:22,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:51:22,313 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:51:22,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-12 23:51:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:22,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-12 23:51:22,476 INFO L278 TraceCheckSpWp]: Computing forward predicates...