./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_operatoramount_amount50_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-3.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb90cbe18f390dc65f7387fe43db9046561f98e7e8195b9ed1ff6e0d65879371 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:53:08,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:53:09,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:53:09,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:53:09,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:53:09,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:53:09,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:53:09,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:53:09,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:53:09,114 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:53:09,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:53:09,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:53:09,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:53:09,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:53:09,118 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:53:09,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:53:09,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:53:09,119 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:53:09,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:53:09,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:53:09,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:53:09,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:53:09,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:53:09,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:53:09,125 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:53:09,125 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:53:09,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:53:09,126 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:53:09,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:53:09,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:53:09,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:53:09,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:53:09,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:53:09,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:53:09,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:53:09,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:53:09,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:53:09,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:53:09,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:53:09,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:53:09,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:53:09,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:53:09,132 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb90cbe18f390dc65f7387fe43db9046561f98e7e8195b9ed1ff6e0d65879371 [2024-10-11 12:53:09,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:53:09,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:53:09,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:53:09,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:53:09,436 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:53:09,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-3.i [2024-10-11 12:53:10,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:53:11,156 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:53:11,156 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-3.i [2024-10-11 12:53:11,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/56bf21ecb/899f6c6771784633a7784f7e68847f30/FLAGa37752547 [2024-10-11 12:53:11,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/56bf21ecb/899f6c6771784633a7784f7e68847f30 [2024-10-11 12:53:11,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:53:11,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:53:11,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:53:11,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:53:11,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:53:11,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:53:11" (1/1) ... [2024-10-11 12:53:11,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@638d4414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:11, skipping insertion in model container [2024-10-11 12:53:11,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:53:11" (1/1) ... [2024-10-11 12:53:11,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:53:11,722 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_operatoramount_amount50_file-3.i[914,927] [2024-10-11 12:53:11,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:53:11,827 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:53:11,879 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-3.i[914,927] [2024-10-11 12:53:11,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:53:11,969 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:53:11,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:11 WrapperNode [2024-10-11 12:53:11,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:53:11,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:53:11,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:53:11,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:53:11,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:11" (1/1) ... [2024-10-11 12:53:11,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:11" (1/1) ... [2024-10-11 12:53:12,032 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-10-11 12:53:12,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:53:12,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:53:12,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:53:12,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:53:12,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:11" (1/1) ... [2024-10-11 12:53:12,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:11" (1/1) ... [2024-10-11 12:53:12,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:11" (1/1) ... [2024-10-11 12:53:12,074 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:53:12,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:11" (1/1) ... [2024-10-11 12:53:12,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:11" (1/1) ... [2024-10-11 12:53:12,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:11" (1/1) ... [2024-10-11 12:53:12,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:11" (1/1) ... [2024-10-11 12:53:12,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:11" (1/1) ... [2024-10-11 12:53:12,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:11" (1/1) ... [2024-10-11 12:53:12,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:53:12,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:53:12,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:53:12,111 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:53:12,112 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:11" (1/1) ... [2024-10-11 12:53:12,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:53:12,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:53:12,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:53:12,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:53:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:53:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:53:12,192 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:53:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:53:12,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:53:12,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:53:12,265 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:53:12,267 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:53:12,607 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 12:53:12,607 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:53:12,646 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:53:12,647 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:53:12,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:53:12 BoogieIcfgContainer [2024-10-11 12:53:12,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:53:12,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:53:12,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:53:12,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:53:12,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:53:11" (1/3) ... [2024-10-11 12:53:12,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3570c798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:53:12, skipping insertion in model container [2024-10-11 12:53:12,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:11" (2/3) ... [2024-10-11 12:53:12,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3570c798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:53:12, skipping insertion in model container [2024-10-11 12:53:12,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:53:12" (3/3) ... [2024-10-11 12:53:12,657 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-3.i [2024-10-11 12:53:12,675 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:53:12,676 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:53:12,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:53:12,735 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;@2a8d2a33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:53:12,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:53:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 47 states have (on average 1.574468085106383) internal successors, (74), 48 states have internal predecessors, (74), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 12:53:12,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 12:53:12,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:53:12,751 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:53:12,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:53:12,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:53:12,757 INFO L85 PathProgramCache]: Analyzing trace with hash -371069709, now seen corresponding path program 1 times [2024-10-11 12:53:12,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:53:12,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864014962] [2024-10-11 12:53:12,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:53:12,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:53:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:53:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:53:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:53:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:53:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:53:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:53:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:53:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:53:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:53:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:53:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:53:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:53:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:53:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:53:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:53:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:53:13,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:53:13,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864014962] [2024-10-11 12:53:13,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864014962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:53:13,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:53:13,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:53:13,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938032889] [2024-10-11 12:53:13,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:53:13,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:53:13,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:53:13,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:53:13,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:53:13,222 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.574468085106383) internal successors, (74), 48 states have internal predecessors, (74), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 12:53:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:53:13,270 INFO L93 Difference]: Finished difference Result 127 states and 221 transitions. [2024-10-11 12:53:13,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:53:13,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2024-10-11 12:53:13,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:53:13,284 INFO L225 Difference]: With dead ends: 127 [2024-10-11 12:53:13,285 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 12:53:13,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:53:13,293 INFO L432 NwaCegarLoop]: 95 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, 95 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:53:13,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:53:13,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 12:53:13,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-11 12:53:13,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 46 states have internal predecessors, (68), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 12:53:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 98 transitions. [2024-10-11 12:53:13,335 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 98 transitions. Word has length 101 [2024-10-11 12:53:13,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:53:13,337 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 98 transitions. [2024-10-11 12:53:13,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 12:53:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 98 transitions. [2024-10-11 12:53:13,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 12:53:13,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:53:13,345 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:53:13,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:53:13,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:53:13,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:53:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash 300332529, now seen corresponding path program 1 times [2024-10-11 12:53:13,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:53:13,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22355104] [2024-10-11 12:53:13,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:53:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:53:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:53:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:53:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:53:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:53:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:53:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:53:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:53:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:53:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:53:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:53:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:53:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:53:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:53:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:53:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:53:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:53:13,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:53:13,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22355104] [2024-10-11 12:53:13,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22355104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:53:13,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:53:13,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:53:13,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604949031] [2024-10-11 12:53:13,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:53:13,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:53:13,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:53:13,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:53:13,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:53:13,885 INFO L87 Difference]: Start difference. First operand 63 states and 98 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:53:13,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:53:13,985 INFO L93 Difference]: Finished difference Result 187 states and 292 transitions. [2024-10-11 12:53:13,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:53:13,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-10-11 12:53:13,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:53:13,991 INFO L225 Difference]: With dead ends: 187 [2024-10-11 12:53:13,991 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 12:53:13,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:53:13,995 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 60 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:53:13,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 168 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:53:13,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 12:53:14,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-10-11 12:53:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 12:53:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 190 transitions. [2024-10-11 12:53:14,022 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 190 transitions. Word has length 101 [2024-10-11 12:53:14,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:53:14,023 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 190 transitions. [2024-10-11 12:53:14,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:53:14,023 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 190 transitions. [2024-10-11 12:53:14,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 12:53:14,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:53:14,027 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:53:14,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:53:14,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:53:14,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:53:14,028 INFO L85 PathProgramCache]: Analyzing trace with hash -100816560, now seen corresponding path program 1 times [2024-10-11 12:53:14,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:53:14,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712960592] [2024-10-11 12:53:14,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:53:14,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:53:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:53:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:53:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:53:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:53:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:53:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:53:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:53:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:53:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:53:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:53:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:53:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:53:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:53:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:53:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:53:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:53:14,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:53:14,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712960592] [2024-10-11 12:53:14,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712960592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:53:14,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:53:14,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:53:14,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983196927] [2024-10-11 12:53:14,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:53:14,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:53:14,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:53:14,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:53:14,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:53:14,238 INFO L87 Difference]: Start difference. First operand 123 states and 190 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:53:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:53:14,356 INFO L93 Difference]: Finished difference Result 359 states and 558 transitions. [2024-10-11 12:53:14,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:53:14,357 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-10-11 12:53:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:53:14,362 INFO L225 Difference]: With dead ends: 359 [2024-10-11 12:53:14,364 INFO L226 Difference]: Without dead ends: 237 [2024-10-11 12:53:14,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:53:14,366 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 84 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:53:14,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 244 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:53:14,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-11 12:53:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2024-10-11 12:53:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 170 states have (on average 1.423529411764706) internal successors, (242), 170 states have internal predecessors, (242), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 12:53:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 362 transitions. [2024-10-11 12:53:14,430 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 362 transitions. Word has length 102 [2024-10-11 12:53:14,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:53:14,431 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 362 transitions. [2024-10-11 12:53:14,431 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:53:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 362 transitions. [2024-10-11 12:53:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 12:53:14,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:53:14,435 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:53:14,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:53:14,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:53:14,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:53:14,436 INFO L85 PathProgramCache]: Analyzing trace with hash 470615492, now seen corresponding path program 1 times [2024-10-11 12:53:14,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:53:14,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429903693] [2024-10-11 12:53:14,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:53:14,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:53:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:53:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:53:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:53:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:53:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:53:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:53:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:53:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:53:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:53:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:53:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:53:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:53:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:53:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:53:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:53:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:14,591 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:53:14,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:53:14,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429903693] [2024-10-11 12:53:14,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429903693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:53:14,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:53:14,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:53:14,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534967222] [2024-10-11 12:53:14,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:53:14,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:53:14,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:53:14,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:53:14,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:53:14,595 INFO L87 Difference]: Start difference. First operand 235 states and 362 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:53:14,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:53:14,651 INFO L93 Difference]: Finished difference Result 579 states and 888 transitions. [2024-10-11 12:53:14,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:53:14,652 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-10-11 12:53:14,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:53:14,656 INFO L225 Difference]: With dead ends: 579 [2024-10-11 12:53:14,656 INFO L226 Difference]: Without dead ends: 345 [2024-10-11 12:53:14,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:53:14,658 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 38 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:53:14,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 206 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:53:14,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-11 12:53:14,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 267. [2024-10-11 12:53:14,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 202 states have (on average 1.4158415841584158) internal successors, (286), 202 states have internal predecessors, (286), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 12:53:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 406 transitions. [2024-10-11 12:53:14,702 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 406 transitions. Word has length 102 [2024-10-11 12:53:14,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:53:14,703 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 406 transitions. [2024-10-11 12:53:14,703 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:53:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 406 transitions. [2024-10-11 12:53:14,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 12:53:14,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:53:14,706 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:53:14,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 12:53:14,706 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:53:14,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:53:14,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1801704341, now seen corresponding path program 1 times [2024-10-11 12:53:14,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:53:14,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290407967] [2024-10-11 12:53:14,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:53:14,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:53:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:15,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:53:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:15,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:53:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:15,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:53:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:15,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:53:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:15,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:53:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:15,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:53:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:15,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:53:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:15,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:53:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:15,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:53:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:15,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:53:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:15,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:53:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:15,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:53:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:15,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:53:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:15,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:53:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:15,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:53:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 12:53:15,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:53:15,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290407967] [2024-10-11 12:53:15,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290407967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:53:15,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:53:15,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 12:53:15,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865013445] [2024-10-11 12:53:15,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:53:15,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 12:53:15,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:53:15,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 12:53:15,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:53:15,591 INFO L87 Difference]: Start difference. First operand 267 states and 406 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:53:16,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:53:16,506 INFO L93 Difference]: Finished difference Result 815 states and 1194 transitions. [2024-10-11 12:53:16,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 12:53:16,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-10-11 12:53:16,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:53:16,512 INFO L225 Difference]: With dead ends: 815 [2024-10-11 12:53:16,512 INFO L226 Difference]: Without dead ends: 549 [2024-10-11 12:53:16,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2024-10-11 12:53:16,515 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 202 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:53:16,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 342 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 12:53:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-10-11 12:53:16,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 335. [2024-10-11 12:53:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 266 states have internal predecessors, (379), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 12:53:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 499 transitions. [2024-10-11 12:53:16,585 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 499 transitions. Word has length 103 [2024-10-11 12:53:16,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:53:16,586 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 499 transitions. [2024-10-11 12:53:16,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:53:16,587 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 499 transitions. [2024-10-11 12:53:16,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 12:53:16,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:53:16,590 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:53:16,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 12:53:16,591 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:53:16,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:53:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1472194601, now seen corresponding path program 1 times [2024-10-11 12:53:16,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:53:16,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697429014] [2024-10-11 12:53:16,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:53:16,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:53:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:16,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:53:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:16,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:53:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:16,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:53:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:16,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:53:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:16,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:53:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:16,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:53:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:16,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:53:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:16,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:53:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:16,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:53:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:16,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:53:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:16,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:53:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:16,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:53:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:16,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:53:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:16,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:53:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:16,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:53:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:16,802 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:53:16,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:53:16,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697429014] [2024-10-11 12:53:16,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697429014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:53:16,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:53:16,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:53:16,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101745460] [2024-10-11 12:53:16,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:53:16,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:53:16,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:53:16,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:53:16,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:53:16,807 INFO L87 Difference]: Start difference. First operand 335 states and 499 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:53:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:53:16,925 INFO L93 Difference]: Finished difference Result 815 states and 1214 transitions. [2024-10-11 12:53:16,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:53:16,926 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-10-11 12:53:16,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:53:16,929 INFO L225 Difference]: With dead ends: 815 [2024-10-11 12:53:16,929 INFO L226 Difference]: Without dead ends: 481 [2024-10-11 12:53:16,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:53:16,931 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 61 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:53:16,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 200 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:53:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-10-11 12:53:17,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 479. [2024-10-11 12:53:17,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 376 states have (on average 1.4122340425531914) internal successors, (531), 376 states have internal predecessors, (531), 90 states have call successors, (90), 12 states have call predecessors, (90), 12 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-11 12:53:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2024-10-11 12:53:17,055 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 103 [2024-10-11 12:53:17,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:53:17,056 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2024-10-11 12:53:17,056 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:53:17,057 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2024-10-11 12:53:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 12:53:17,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:53:17,058 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:53:17,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 12:53:17,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:53:17,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:53:17,059 INFO L85 PathProgramCache]: Analyzing trace with hash -744832923, now seen corresponding path program 1 times [2024-10-11 12:53:17,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:53:17,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202364128] [2024-10-11 12:53:17,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:53:17,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:53:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:17,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:53:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:17,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:53:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:17,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:53:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:17,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:53:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:17,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:53:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:17,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:53:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:17,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:53:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:17,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:53:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:17,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:53:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:17,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:53:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:17,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:53:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:17,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:53:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:17,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:53:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:17,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:53:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:17,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:53:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:53:17,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:53:17,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202364128] [2024-10-11 12:53:17,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202364128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:53:17,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:53:17,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 12:53:17,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273791831] [2024-10-11 12:53:17,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:53:17,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:53:17,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:53:17,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:53:17,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:53:17,296 INFO L87 Difference]: Start difference. First operand 479 states and 711 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:53:17,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:53:17,592 INFO L93 Difference]: Finished difference Result 1205 states and 1794 transitions. [2024-10-11 12:53:17,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:53:17,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-10-11 12:53:17,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:53:17,599 INFO L225 Difference]: With dead ends: 1205 [2024-10-11 12:53:17,599 INFO L226 Difference]: Without dead ends: 965 [2024-10-11 12:53:17,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:53:17,601 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:53:17,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 376 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:53:17,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-10-11 12:53:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 953. [2024-10-11 12:53:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 748 states have (on average 1.414438502673797) internal successors, (1058), 748 states have internal predecessors, (1058), 180 states have call successors, (180), 24 states have call predecessors, (180), 24 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2024-10-11 12:53:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1418 transitions. [2024-10-11 12:53:17,748 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1418 transitions. Word has length 103 [2024-10-11 12:53:17,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:53:17,748 INFO L471 AbstractCegarLoop]: Abstraction has 953 states and 1418 transitions. [2024-10-11 12:53:17,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:53:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1418 transitions. [2024-10-11 12:53:17,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 12:53:17,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:53:17,750 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:53:17,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 12:53:17,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:53:17,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:53:17,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2001488749, now seen corresponding path program 1 times [2024-10-11 12:53:17,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:53:17,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970479233] [2024-10-11 12:53:17,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:53:17,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:53:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:18,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:53:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:18,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:53:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:18,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:53:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:18,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:53:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:18,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:53:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:18,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:53:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:53:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:18,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:53:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:18,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:53:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:18,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:53:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:18,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:53:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:18,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:53:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:18,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:53:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:18,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:53:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:18,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:53:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:53:18,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:53:18,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970479233] [2024-10-11 12:53:18,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970479233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:53:18,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:53:18,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 12:53:18,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082394472] [2024-10-11 12:53:18,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:53:18,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 12:53:18,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:53:18,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 12:53:18,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:53:18,107 INFO L87 Difference]: Start difference. First operand 953 states and 1418 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 12:53:18,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:53:18,684 INFO L93 Difference]: Finished difference Result 2069 states and 3072 transitions. [2024-10-11 12:53:18,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 12:53:18,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 104 [2024-10-11 12:53:18,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:53:18,691 INFO L225 Difference]: With dead ends: 2069 [2024-10-11 12:53:18,691 INFO L226 Difference]: Without dead ends: 1117 [2024-10-11 12:53:18,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-10-11 12:53:18,694 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 351 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:53:18,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 441 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 12:53:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2024-10-11 12:53:18,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1097. [2024-10-11 12:53:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 858 states have (on average 1.4114219114219113) internal successors, (1211), 858 states have internal predecessors, (1211), 210 states have call successors, (210), 28 states have call predecessors, (210), 28 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-10-11 12:53:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1631 transitions. [2024-10-11 12:53:18,858 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1631 transitions. Word has length 104 [2024-10-11 12:53:18,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:53:18,858 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1631 transitions. [2024-10-11 12:53:18,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 12:53:18,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1631 transitions. [2024-10-11 12:53:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 12:53:18,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:53:18,860 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:53:18,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 12:53:18,861 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:53:18,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:53:18,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1449877799, now seen corresponding path program 1 times [2024-10-11 12:53:18,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:53:18,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588914954] [2024-10-11 12:53:18,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:53:18,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:53:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:19,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:53:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:19,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:53:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:19,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:53:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:19,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:53:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:19,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:53:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:19,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:53:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:19,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:53:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:19,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:53:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:19,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:53:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:19,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:53:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:19,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:53:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:19,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:53:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:19,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:53:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:19,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:53:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:19,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:53:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 87 proven. 21 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 12:53:19,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:53:19,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588914954] [2024-10-11 12:53:19,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588914954] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:53:19,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380445878] [2024-10-11 12:53:19,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:53:19,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:53:19,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:53:19,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:53:19,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 12:53:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:19,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 12:53:19,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:53:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 310 proven. 21 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-10-11 12:53:20,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:53:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 111 proven. 39 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-10-11 12:53:21,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380445878] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:53:21,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 12:53:21,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 15] total 35 [2024-10-11 12:53:21,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153157573] [2024-10-11 12:53:21,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 12:53:21,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 12:53:21,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:53:21,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 12:53:21,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=888, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 12:53:21,809 INFO L87 Difference]: Start difference. First operand 1097 states and 1631 transitions. Second operand has 35 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 33 states have internal predecessors, (98), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) [2024-10-11 12:53:23,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:53:23,447 INFO L93 Difference]: Finished difference Result 2053 states and 2928 transitions. [2024-10-11 12:53:23,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 12:53:23,448 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 33 states have internal predecessors, (98), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) Word has length 104 [2024-10-11 12:53:23,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:53:23,454 INFO L225 Difference]: With dead ends: 2053 [2024-10-11 12:53:23,454 INFO L226 Difference]: Without dead ends: 1245 [2024-10-11 12:53:23,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1090, Invalid=2570, Unknown=0, NotChecked=0, Total=3660 [2024-10-11 12:53:23,460 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 1024 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 12:53:23,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 310 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 12:53:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2024-10-11 12:53:23,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 507. [2024-10-11 12:53:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 386 states have (on average 1.3238341968911918) internal successors, (511), 386 states have internal predecessors, (511), 90 states have call successors, (90), 30 states have call predecessors, (90), 30 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-11 12:53:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 691 transitions. [2024-10-11 12:53:23,573 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 691 transitions. Word has length 104 [2024-10-11 12:53:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:53:23,573 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 691 transitions. [2024-10-11 12:53:23,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 33 states have internal predecessors, (98), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) [2024-10-11 12:53:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 691 transitions. [2024-10-11 12:53:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 12:53:23,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:53:23,575 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:53:23,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 12:53:23,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:53:23,776 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:53:23,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:53:23,777 INFO L85 PathProgramCache]: Analyzing trace with hash -291375114, now seen corresponding path program 1 times [2024-10-11 12:53:23,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:53:23,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239399359] [2024-10-11 12:53:23,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:53:23,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:53:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:23,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:53:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:23,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:53:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:23,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:53:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:23,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:53:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:23,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:53:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:23,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:53:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:23,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:53:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:23,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:53:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:23,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:53:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:24,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:53:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:24,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:53:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:24,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:53:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:24,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:53:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:24,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:53:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:24,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:53:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:53:24,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:53:24,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239399359] [2024-10-11 12:53:24,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239399359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:53:24,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:53:24,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:53:24,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439378558] [2024-10-11 12:53:24,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:53:24,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:53:24,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:53:24,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:53:24,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:53:24,030 INFO L87 Difference]: Start difference. First operand 507 states and 691 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:53:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:53:24,396 INFO L93 Difference]: Finished difference Result 1303 states and 1801 transitions. [2024-10-11 12:53:24,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:53:24,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-10-11 12:53:24,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:53:24,403 INFO L225 Difference]: With dead ends: 1303 [2024-10-11 12:53:24,403 INFO L226 Difference]: Without dead ends: 1047 [2024-10-11 12:53:24,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:53:24,405 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 168 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:53:24,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 351 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:53:24,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2024-10-11 12:53:24,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 920. [2024-10-11 12:53:24,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 719 states have (on average 1.3421418636995828) internal successors, (965), 719 states have internal predecessors, (965), 150 states have call successors, (150), 50 states have call predecessors, (150), 50 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-11 12:53:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1265 transitions. [2024-10-11 12:53:24,579 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1265 transitions. Word has length 104 [2024-10-11 12:53:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:53:24,580 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1265 transitions. [2024-10-11 12:53:24,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:53:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1265 transitions. [2024-10-11 12:53:24,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 12:53:24,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:53:24,581 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:53:24,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 12:53:24,581 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:53:24,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:53:24,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1054749202, now seen corresponding path program 1 times [2024-10-11 12:53:24,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:53:24,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999010339] [2024-10-11 12:53:24,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:53:24,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:53:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:53:24,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1631338807] [2024-10-11 12:53:24,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:53:24,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:53:24,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:53:24,630 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:53:24,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 12:53:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:53:24,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:53:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:53:24,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:53:24,868 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:53:24,868 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:53:24,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 12:53:25,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:53:25,076 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:53:25,155 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:53:25,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:53:25 BoogieIcfgContainer [2024-10-11 12:53:25,159 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:53:25,160 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:53:25,160 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:53:25,160 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:53:25,161 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:53:12" (3/4) ... [2024-10-11 12:53:25,163 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:53:25,164 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:53:25,165 INFO L158 Benchmark]: Toolchain (without parser) took 13636.94ms. Allocated memory was 161.5MB in the beginning and 394.3MB in the end (delta: 232.8MB). Free memory was 91.3MB in the beginning and 309.3MB in the end (delta: -218.0MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-10-11 12:53:25,165 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:53:25,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.12ms. Allocated memory is still 161.5MB. Free memory was 91.1MB in the beginning and 129.8MB in the end (delta: -38.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 12:53:25,166 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.83ms. Allocated memory is still 161.5MB. Free memory was 129.8MB in the beginning and 126.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:53:25,166 INFO L158 Benchmark]: Boogie Preprocessor took 75.28ms. Allocated memory is still 161.5MB. Free memory was 126.2MB in the beginning and 121.1MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:53:25,166 INFO L158 Benchmark]: RCFGBuilder took 537.67ms. Allocated memory is still 161.5MB. Free memory was 121.1MB in the beginning and 95.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 12:53:25,167 INFO L158 Benchmark]: TraceAbstraction took 12509.77ms. Allocated memory was 161.5MB in the beginning and 394.3MB in the end (delta: 232.8MB). Free memory was 94.7MB in the beginning and 309.3MB in the end (delta: -214.6MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-10-11 12:53:25,167 INFO L158 Benchmark]: Witness Printer took 4.37ms. Allocated memory is still 394.3MB. Free memory is still 309.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:53:25,168 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.19ms. Allocated memory is still 161.5MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.12ms. Allocated memory is still 161.5MB. Free memory was 91.1MB in the beginning and 129.8MB in the end (delta: -38.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.83ms. Allocated memory is still 161.5MB. Free memory was 129.8MB in the beginning and 126.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.28ms. Allocated memory is still 161.5MB. Free memory was 126.2MB in the beginning and 121.1MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 537.67ms. Allocated memory is still 161.5MB. Free memory was 121.1MB in the beginning and 95.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12509.77ms. Allocated memory was 161.5MB in the beginning and 394.3MB in the end (delta: 232.8MB). Free memory was 94.7MB in the beginning and 309.3MB in the end (delta: -214.6MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Witness Printer took 4.37ms. Allocated memory is still 394.3MB. Free memory is still 309.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of bitwiseOr at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int last_1_var_1_10 = 256; [L38] unsigned char last_1_var_1_20 = 32; [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L113] last_1_var_1_10 = var_1_10 [L114] last_1_var_1_20 = var_1_20 [L124] RET updateLastVariables() [L125] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L89] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L90] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L90] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L91] var_1_5 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L92] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L93] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L93] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L94] var_1_13 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L95] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L96] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L96] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L97] var_1_14 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L98] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L99] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L99] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L100] var_1_15 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L101] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L102] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L102] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L103] var_1_16 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L104] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L105] var_1_21 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L106] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L107] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L107] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L108] var_1_22 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L109] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L110] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L110] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L125] RET updateVariables() [L126] CALL step() [L42] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L47] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-8, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L48] COND TRUE stepLocal_2 > last_1_var_1_10 [L49] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L51] COND FALSE !((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L56] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L67] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L68] COND FALSE !(stepLocal_1 || var_1_3) [L73] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L75] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L80] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L80] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L81] COND TRUE var_1_20 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L82] COND FALSE !(var_1_12 == var_1_12) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L117-L118] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2062 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2056 mSDsluCounter, 2733 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1700 mSDsCounter, 462 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1321 IncrementalHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 462 mSolverCounterUnsat, 1033 mSDtfsCounter, 1321 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 628 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1097occurred in iteration=8, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 1195 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1341 NumberOfCodeBlocks, 1341 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1223 ConstructedInterpolants, 0 QuantifiedInterpolants, 5736 SizeOfPredicates, 6 NumberOfNonLiveVariables, 245 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 4959/5040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 12:53:25,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-3.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb90cbe18f390dc65f7387fe43db9046561f98e7e8195b9ed1ff6e0d65879371 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:53:27,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:53:27,596 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:53:27,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:53:27,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:53:27,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:53:27,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:53:27,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:53:27,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:53:27,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:53:27,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:53:27,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:53:27,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:53:27,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:53:27,657 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:53:27,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:53:27,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:53:27,661 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:53:27,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:53:27,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:53:27,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:53:27,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:53:27,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:53:27,665 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:53:27,666 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:53:27,666 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:53:27,666 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:53:27,666 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:53:27,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:53:27,667 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:53:27,667 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:53:27,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:53:27,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:53:27,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:53:27,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:53:27,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:53:27,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:53:27,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:53:27,669 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:53:27,669 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:53:27,669 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:53:27,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:53:27,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:53:27,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:53:27,672 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:53:27,672 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb90cbe18f390dc65f7387fe43db9046561f98e7e8195b9ed1ff6e0d65879371 [2024-10-11 12:53:28,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:53:28,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:53:28,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:53:28,063 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:53:28,063 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:53:28,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-3.i [2024-10-11 12:53:29,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:53:29,943 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:53:29,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-3.i [2024-10-11 12:53:29,957 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b2bdd49cc/3c05102c8e9d457e9e043b751c25deb9/FLAG589560327 [2024-10-11 12:53:29,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b2bdd49cc/3c05102c8e9d457e9e043b751c25deb9 [2024-10-11 12:53:29,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:53:29,973 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:53:29,974 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:53:29,974 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:53:29,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:53:29,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:53:29" (1/1) ... [2024-10-11 12:53:29,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@497b7dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:29, skipping insertion in model container [2024-10-11 12:53:29,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:53:29" (1/1) ... [2024-10-11 12:53:30,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:53:30,203 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_operatoramount_amount50_file-3.i[914,927] [2024-10-11 12:53:30,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:53:30,296 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:53:30,310 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_operatoramount_amount50_file-3.i[914,927] [2024-10-11 12:53:30,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:53:30,373 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:53:30,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:30 WrapperNode [2024-10-11 12:53:30,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:53:30,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:53:30,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:53:30,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:53:30,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:30" (1/1) ... [2024-10-11 12:53:30,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:30" (1/1) ... [2024-10-11 12:53:30,435 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-10-11 12:53:30,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:53:30,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:53:30,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:53:30,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:53:30,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:30" (1/1) ... [2024-10-11 12:53:30,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:30" (1/1) ... [2024-10-11 12:53:30,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:30" (1/1) ... [2024-10-11 12:53:30,483 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:53:30,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:30" (1/1) ... [2024-10-11 12:53:30,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:30" (1/1) ... [2024-10-11 12:53:30,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:30" (1/1) ... [2024-10-11 12:53:30,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:30" (1/1) ... [2024-10-11 12:53:30,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:30" (1/1) ... [2024-10-11 12:53:30,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:30" (1/1) ... [2024-10-11 12:53:30,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:53:30,521 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:53:30,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:53:30,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:53:30,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:30" (1/1) ... [2024-10-11 12:53:30,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:53:30,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:53:30,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:53:30,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:53:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:53:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:53:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:53:30,610 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:53:30,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:53:30,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:53:30,706 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:53:30,708 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:53:45,387 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 12:53:45,388 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:53:45,433 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:53:45,433 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:53:45,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:53:45 BoogieIcfgContainer [2024-10-11 12:53:45,434 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:53:45,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:53:45,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:53:45,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:53:45,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:53:29" (1/3) ... [2024-10-11 12:53:45,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed81030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:53:45, skipping insertion in model container [2024-10-11 12:53:45,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:53:30" (2/3) ... [2024-10-11 12:53:45,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed81030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:53:45, skipping insertion in model container [2024-10-11 12:53:45,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:53:45" (3/3) ... [2024-10-11 12:53:45,444 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-3.i [2024-10-11 12:53:45,460 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:53:45,460 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:53:45,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:53:45,552 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;@e6ee4c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:53:45,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:53:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 states have internal predecessors, (56), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 12:53:45,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 12:53:45,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:53:45,569 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:53:45,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:53:45,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:53:45,576 INFO L85 PathProgramCache]: Analyzing trace with hash 951955188, now seen corresponding path program 1 times [2024-10-11 12:53:45,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:53:45,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108194522] [2024-10-11 12:53:45,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:53:45,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:53:45,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:53:45,594 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:53:45,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 12:53:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:46,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:53:46,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:53:46,487 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-10-11 12:53:46,488 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:53:46,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:53:46,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108194522] [2024-10-11 12:53:46,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108194522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:53:46,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:53:46,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:53:46,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389439139] [2024-10-11 12:53:46,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:53:46,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:53:46,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:53:46,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:53:46,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:53:46,526 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 states have internal predecessors, (56), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 12:53:50,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:53:50,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:53:50,847 INFO L93 Difference]: Finished difference Result 105 states and 185 transitions. [2024-10-11 12:53:50,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:53:50,947 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2024-10-11 12:53:50,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:53:50,954 INFO L225 Difference]: With dead ends: 105 [2024-10-11 12:53:50,954 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 12:53:50,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:53:50,960 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:53:50,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 12:53:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 12:53:50,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 12:53:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 12:53:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 80 transitions. [2024-10-11 12:53:51,003 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 80 transitions. Word has length 98 [2024-10-11 12:53:51,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:53:51,004 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 80 transitions. [2024-10-11 12:53:51,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 12:53:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 80 transitions. [2024-10-11 12:53:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 12:53:51,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:53:51,012 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:53:51,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 12:53:51,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:53:51,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:53:51,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:53:51,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1795180874, now seen corresponding path program 1 times [2024-10-11 12:53:51,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:53:51,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449669171] [2024-10-11 12:53:51,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:53:51,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:53:51,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:53:51,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:53:51,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 12:53:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:53:52,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 12:53:52,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:53:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:53:57,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:53:57,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:53:57,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449669171] [2024-10-11 12:53:57,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449669171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:53:57,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:53:57,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:53:57,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547441444] [2024-10-11 12:53:57,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:53:57,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:53:57,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:53:57,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:53:57,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:53:57,099 INFO L87 Difference]: Start difference. First operand 52 states and 80 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:54:00,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:54:04,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:54:08,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:54:13,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:54:16,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:54:21,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:54:25,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:54:29,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:54:29,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:54:29,510 INFO L93 Difference]: Finished difference Result 154 states and 238 transitions. [2024-10-11 12:54:29,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:54:29,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-10-11 12:54:29,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:54:29,516 INFO L225 Difference]: With dead ends: 154 [2024-10-11 12:54:29,516 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 12:54:29,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:54:29,525 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 30 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:54:29,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 132 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 6 Unknown, 0 Unchecked, 32.4s Time] [2024-10-11 12:54:29,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 12:54:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2024-10-11 12:54:29,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 12:54:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 156 transitions. [2024-10-11 12:54:29,558 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 156 transitions. Word has length 98 [2024-10-11 12:54:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:54:29,559 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 156 transitions. [2024-10-11 12:54:29,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:54:29,559 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2024-10-11 12:54:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 12:54:29,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:54:29,561 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:54:29,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 12:54:29,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:54:29,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:54:29,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:54:29,764 INFO L85 PathProgramCache]: Analyzing trace with hash 441095034, now seen corresponding path program 1 times [2024-10-11 12:54:29,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:54:29,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195777116] [2024-10-11 12:54:29,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:54:29,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:54:29,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:54:29,772 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:54:29,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 12:54:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:30,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 12:54:30,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:54:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:54:30,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:54:30,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:54:30,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195777116] [2024-10-11 12:54:30,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195777116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:54:30,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:54:30,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:54:30,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238852754] [2024-10-11 12:54:30,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:54:30,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:54:30,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:54:30,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:54:30,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:54:30,819 INFO L87 Difference]: Start difference. First operand 101 states and 156 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:54:35,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:54:39,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []