./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_amount10_file-60.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_amount10_file-60.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 e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:20:22,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:20:22,980 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:20:22,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:20:22,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:20:23,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:20:23,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:20:23,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:20:23,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:20:23,030 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:20:23,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:20:23,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:20:23,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:20:23,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:20:23,033 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:20:23,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:20:23,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:20:23,038 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:20:23,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:20:23,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:20:23,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:20:23,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:20:23,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:20:23,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:20:23,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:20:23,040 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:20:23,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:20:23,041 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:20:23,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:20:23,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:20:23,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:20:23,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:20:23,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:20:23,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:20:23,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:20:23,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:20:23,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:20:23,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:20:23,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:20:23,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:20:23,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:20:23,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:20:23,047 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 -> e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 [2024-10-11 12:20:23,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:20:23,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:20:23,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:20:23,323 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:20:23,324 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:20:23,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-10-11 12:20:24,890 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:20:25,092 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:20:25,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-10-11 12:20:25,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e927572a7/6a18c1536897439eb86e98fdadda04f5/FLAG175e156cb [2024-10-11 12:20:25,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e927572a7/6a18c1536897439eb86e98fdadda04f5 [2024-10-11 12:20:25,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:20:25,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:20:25,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:20:25,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:20:25,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:20:25,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:25" (1/1) ... [2024-10-11 12:20:25,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35d5bd8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:25, skipping insertion in model container [2024-10-11 12:20:25,129 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:25" (1/1) ... [2024-10-11 12:20:25,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:20:25,327 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_amount10_file-60.i[915,928] [2024-10-11 12:20:25,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:20:25,391 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:20:25,405 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_amount10_file-60.i[915,928] [2024-10-11 12:20:25,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:20:25,448 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:20:25,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:25 WrapperNode [2024-10-11 12:20:25,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:20:25,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:20:25,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:20:25,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:20:25,458 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:20:25" (1/1) ... [2024-10-11 12:20:25,470 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:20:25" (1/1) ... [2024-10-11 12:20:25,503 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-11 12:20:25,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:20:25,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:20:25,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:20:25,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:20:25,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:25" (1/1) ... [2024-10-11 12:20:25,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:25" (1/1) ... [2024-10-11 12:20:25,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:25" (1/1) ... [2024-10-11 12:20:25,543 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:20:25,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:25" (1/1) ... [2024-10-11 12:20:25,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:25" (1/1) ... [2024-10-11 12:20:25,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:25" (1/1) ... [2024-10-11 12:20:25,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:25" (1/1) ... [2024-10-11 12:20:25,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:25" (1/1) ... [2024-10-11 12:20:25,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:25" (1/1) ... [2024-10-11 12:20:25,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:20:25,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:20:25,570 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:20:25,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:20:25,574 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:25" (1/1) ... [2024-10-11 12:20:25,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:20:25,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:20:25,605 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:20:25,608 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:20:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:20:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:20:25,659 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:20:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:20:25,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:20:25,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:20:25,733 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:20:25,738 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:20:26,022 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 12:20:26,023 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:20:26,066 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:20:26,068 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:20:26,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:26 BoogieIcfgContainer [2024-10-11 12:20:26,069 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:20:26,071 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:20:26,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:20:26,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:20:26,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:20:25" (1/3) ... [2024-10-11 12:20:26,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376839bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:26, skipping insertion in model container [2024-10-11 12:20:26,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:25" (2/3) ... [2024-10-11 12:20:26,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376839bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:26, skipping insertion in model container [2024-10-11 12:20:26,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:26" (3/3) ... [2024-10-11 12:20:26,081 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-60.i [2024-10-11 12:20:26,101 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:20:26,101 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:20:26,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:20:26,186 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;@64815544, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:20:26,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:20:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 12:20:26,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 12:20:26,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:26,205 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:26,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:26,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:26,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1377890462, now seen corresponding path program 1 times [2024-10-11 12:20:26,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:20:26,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274288543] [2024-10-11 12:20:26,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:26,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:20:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:26,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:20:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:26,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:20:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:26,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:20:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:26,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:20:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:26,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:20:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:26,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:20:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:26,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:20:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:26,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:20:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:26,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:20:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:26,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:20:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:26,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:20:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:26,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:20:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:26,569 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 12:20:26,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:20:26,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274288543] [2024-10-11 12:20:26,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274288543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:26,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:26,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:20:26,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343976386] [2024-10-11 12:20:26,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:26,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:20:26,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:20:26,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:20:26,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:20:26,621 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 12:20:26,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:26,677 INFO L93 Difference]: Finished difference Result 87 states and 146 transitions. [2024-10-11 12:20:26,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:20:26,680 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 77 [2024-10-11 12:20:26,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:26,687 INFO L225 Difference]: With dead ends: 87 [2024-10-11 12:20:26,687 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 12:20:26,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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:20:26,697 INFO L432 NwaCegarLoop]: 58 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, 58 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:20:26,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:20:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 12:20:26,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 12:20:26,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 12:20:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2024-10-11 12:20:26,752 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 77 [2024-10-11 12:20:26,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:26,753 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2024-10-11 12:20:26,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 12:20:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2024-10-11 12:20:26,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 12:20:26,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:26,757 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:26,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:20:26,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:26,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:26,758 INFO L85 PathProgramCache]: Analyzing trace with hash 255276898, now seen corresponding path program 1 times [2024-10-11 12:20:26,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:20:26,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976041288] [2024-10-11 12:20:26,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:26,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:20:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:20:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:20:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:20:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:20:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:20:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:20:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:20:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:20:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:20:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:20:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:20:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:20:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 12:20:27,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:20:27,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976041288] [2024-10-11 12:20:27,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976041288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:27,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:27,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:20:27,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075326085] [2024-10-11 12:20:27,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:27,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:20:27,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:20:27,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:20:27,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:20:27,466 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:27,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:27,759 INFO L93 Difference]: Finished difference Result 104 states and 146 transitions. [2024-10-11 12:20:27,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:20:27,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2024-10-11 12:20:27,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:27,762 INFO L225 Difference]: With dead ends: 104 [2024-10-11 12:20:27,762 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 12:20:27,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:20:27,764 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 20 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:27,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 121 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:20:27,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 12:20:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 51. [2024-10-11 12:20:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 12:20:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2024-10-11 12:20:27,776 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 77 [2024-10-11 12:20:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:27,778 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2024-10-11 12:20:27,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:27,779 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2024-10-11 12:20:27,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 12:20:27,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:27,783 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:27,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:20:27,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:27,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:27,784 INFO L85 PathProgramCache]: Analyzing trace with hash 935335268, now seen corresponding path program 1 times [2024-10-11 12:20:27,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:20:27,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118021737] [2024-10-11 12:20:27,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:27,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:20:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:20:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:20:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:20:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:20:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:20:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:20:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:20:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:20:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:20:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:20:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:27,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:20:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:28,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:20:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:28,008 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 12:20:28,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:20:28,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118021737] [2024-10-11 12:20:28,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118021737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:28,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:28,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:20:28,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40791373] [2024-10-11 12:20:28,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:28,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:20:28,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:20:28,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:20:28,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:20:28,015 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:28,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:28,074 INFO L93 Difference]: Finished difference Result 143 states and 203 transitions. [2024-10-11 12:20:28,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:20:28,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2024-10-11 12:20:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:28,078 INFO L225 Difference]: With dead ends: 143 [2024-10-11 12:20:28,080 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 12:20:28,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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:20:28,081 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 34 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:28,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 115 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:20:28,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 12:20:28,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-10-11 12:20:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 12:20:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 127 transitions. [2024-10-11 12:20:28,108 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 127 transitions. Word has length 77 [2024-10-11 12:20:28,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:28,110 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 127 transitions. [2024-10-11 12:20:28,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 127 transitions. [2024-10-11 12:20:28,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 12:20:28,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:28,111 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:28,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:20:28,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:28,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:28,112 INFO L85 PathProgramCache]: Analyzing trace with hash -135947097, now seen corresponding path program 1 times [2024-10-11 12:20:28,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:20:28,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382481381] [2024-10-11 12:20:28,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:28,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:20:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:20:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:20:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:20:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:20:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:20:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:20:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:20:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:20:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:20:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:20:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:20:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:20:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 12:20:29,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:20:29,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382481381] [2024-10-11 12:20:29,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382481381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:29,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:29,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 12:20:29,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827385964] [2024-10-11 12:20:29,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:29,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 12:20:29,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:20:29,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 12:20:29,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 12:20:29,134 INFO L87 Difference]: Start difference. First operand 91 states and 127 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:29,752 INFO L93 Difference]: Finished difference Result 148 states and 201 transitions. [2024-10-11 12:20:29,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 12:20:29,755 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2024-10-11 12:20:29,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:29,757 INFO L225 Difference]: With dead ends: 148 [2024-10-11 12:20:29,758 INFO L226 Difference]: Without dead ends: 146 [2024-10-11 12:20:29,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-11 12:20:29,762 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 118 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:29,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 295 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 12:20:29,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-11 12:20:29,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2024-10-11 12:20:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 89 states have internal predecessors, (109), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 12:20:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 169 transitions. [2024-10-11 12:20:29,805 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 169 transitions. Word has length 79 [2024-10-11 12:20:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:29,806 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 169 transitions. [2024-10-11 12:20:29,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:29,808 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 169 transitions. [2024-10-11 12:20:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 12:20:29,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:29,809 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:29,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 12:20:29,809 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:29,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:29,811 INFO L85 PathProgramCache]: Analyzing trace with hash -945293723, now seen corresponding path program 1 times [2024-10-11 12:20:29,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:20:29,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281262269] [2024-10-11 12:20:29,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:29,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:20:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:30,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:20:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:30,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:20:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:30,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:20:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:30,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:20:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:30,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:20:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:30,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:20:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:30,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:20:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:30,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:20:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:30,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:20:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:30,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:20:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:30,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:20:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:30,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:20:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 12:20:30,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:20:30,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281262269] [2024-10-11 12:20:30,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281262269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:30,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:30,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 12:20:30,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208754291] [2024-10-11 12:20:30,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:30,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 12:20:30,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:20:30,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 12:20:30,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 12:20:30,604 INFO L87 Difference]: Start difference. First operand 122 states and 169 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:31,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:31,372 INFO L93 Difference]: Finished difference Result 159 states and 212 transitions. [2024-10-11 12:20:31,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 12:20:31,373 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2024-10-11 12:20:31,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:31,376 INFO L225 Difference]: With dead ends: 159 [2024-10-11 12:20:31,379 INFO L226 Difference]: Without dead ends: 157 [2024-10-11 12:20:31,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-11 12:20:31,381 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 76 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:31,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 482 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 12:20:31,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-11 12:20:31,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 125. [2024-10-11 12:20:31,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 92 states have internal predecessors, (113), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 12:20:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 173 transitions. [2024-10-11 12:20:31,426 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 173 transitions. Word has length 79 [2024-10-11 12:20:31,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:31,427 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 173 transitions. [2024-10-11 12:20:31,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 173 transitions. [2024-10-11 12:20:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 12:20:31,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:31,432 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:31,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 12:20:31,432 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:31,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:31,432 INFO L85 PathProgramCache]: Analyzing trace with hash 806892677, now seen corresponding path program 1 times [2024-10-11 12:20:31,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:20:31,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47202317] [2024-10-11 12:20:31,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:31,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:20:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:20:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:20:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:20:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:20:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:20:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:20:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:20:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:20:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:20:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:20:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:20:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:20:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 12:20:31,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:20:31,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47202317] [2024-10-11 12:20:31,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47202317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:31,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:31,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:20:31,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114140726] [2024-10-11 12:20:31,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:31,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:20:31,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:20:31,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:20:31,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:20:31,504 INFO L87 Difference]: Start difference. First operand 125 states and 173 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:31,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:31,569 INFO L93 Difference]: Finished difference Result 259 states and 361 transitions. [2024-10-11 12:20:31,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:20:31,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2024-10-11 12:20:31,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:31,578 INFO L225 Difference]: With dead ends: 259 [2024-10-11 12:20:31,578 INFO L226 Difference]: Without dead ends: 175 [2024-10-11 12:20:31,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:20:31,580 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 45 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:31,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 139 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:20:31,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-11 12:20:31,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2024-10-11 12:20:31,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 116 states have (on average 1.206896551724138) internal successors, (140), 118 states have internal predecessors, (140), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 12:20:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 236 transitions. [2024-10-11 12:20:31,627 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 236 transitions. Word has length 80 [2024-10-11 12:20:31,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:31,628 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 236 transitions. [2024-10-11 12:20:31,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:31,628 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 236 transitions. [2024-10-11 12:20:31,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 12:20:31,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:31,631 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:31,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 12:20:31,632 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:31,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:31,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1243156778, now seen corresponding path program 1 times [2024-10-11 12:20:31,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:20:31,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134827170] [2024-10-11 12:20:31,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:31,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:20:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:20:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:20:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:20:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:20:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:20:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:20:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:20:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:20:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:20:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:20:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:20:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:20:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 12:20:31,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:20:31,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134827170] [2024-10-11 12:20:31,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134827170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:31,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:31,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:20:31,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775093480] [2024-10-11 12:20:31,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:31,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:20:31,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:20:31,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:20:31,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:20:31,688 INFO L87 Difference]: Start difference. First operand 170 states and 236 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:31,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:31,735 INFO L93 Difference]: Finished difference Result 298 states and 413 transitions. [2024-10-11 12:20:31,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:20:31,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2024-10-11 12:20:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:31,738 INFO L225 Difference]: With dead ends: 298 [2024-10-11 12:20:31,738 INFO L226 Difference]: Without dead ends: 169 [2024-10-11 12:20:31,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:20:31,740 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 52 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:31,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 102 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:20:31,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-11 12:20:31,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2024-10-11 12:20:31,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 113 states have (on average 1.176991150442478) internal successors, (133), 115 states have internal predecessors, (133), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 12:20:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 229 transitions. [2024-10-11 12:20:31,770 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 229 transitions. Word has length 80 [2024-10-11 12:20:31,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:31,770 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 229 transitions. [2024-10-11 12:20:31,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 229 transitions. [2024-10-11 12:20:31,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 12:20:31,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:31,772 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:31,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 12:20:31,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:31,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:31,773 INFO L85 PathProgramCache]: Analyzing trace with hash 854969490, now seen corresponding path program 1 times [2024-10-11 12:20:31,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:20:31,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781858928] [2024-10-11 12:20:31,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:31,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:20:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:20:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:20:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:20:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:20:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:20:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:20:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:20:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:20:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:20:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:20:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:20:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:20:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:31,905 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 12:20:31,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:20:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781858928] [2024-10-11 12:20:31,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781858928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:31,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:31,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:20:31,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304939350] [2024-10-11 12:20:31,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:31,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:20:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:20:31,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:20:31,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:20:31,910 INFO L87 Difference]: Start difference. First operand 167 states and 229 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:31,994 INFO L93 Difference]: Finished difference Result 335 states and 458 transitions. [2024-10-11 12:20:31,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:20:31,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2024-10-11 12:20:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:31,997 INFO L225 Difference]: With dead ends: 335 [2024-10-11 12:20:31,997 INFO L226 Difference]: Without dead ends: 169 [2024-10-11 12:20:31,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:20:32,003 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 17 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:32,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 199 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:20:32,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-11 12:20:32,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2024-10-11 12:20:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 113 states have (on average 1.1504424778761062) internal successors, (130), 115 states have internal predecessors, (130), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 12:20:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 226 transitions. [2024-10-11 12:20:32,037 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 226 transitions. Word has length 80 [2024-10-11 12:20:32,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:32,037 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 226 transitions. [2024-10-11 12:20:32,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 226 transitions. [2024-10-11 12:20:32,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 12:20:32,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:32,038 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:32,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 12:20:32,039 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:32,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:32,039 INFO L85 PathProgramCache]: Analyzing trace with hash 163072564, now seen corresponding path program 1 times [2024-10-11 12:20:32,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:20:32,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283983051] [2024-10-11 12:20:32,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:32,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:20:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:32,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:20:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:32,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:20:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:32,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:20:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:32,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:20:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:32,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:20:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:32,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:20:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:32,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:20:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:32,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:20:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:32,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:20:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:32,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:20:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:32,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:20:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:32,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:20:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:32,155 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 12:20:32,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:20:32,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283983051] [2024-10-11 12:20:32,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283983051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:32,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:32,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:20:32,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247766435] [2024-10-11 12:20:32,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:32,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:20:32,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:20:32,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:20:32,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:20:32,158 INFO L87 Difference]: Start difference. First operand 167 states and 226 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:32,232 INFO L93 Difference]: Finished difference Result 290 states and 385 transitions. [2024-10-11 12:20:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:20:32,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-10-11 12:20:32,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:32,236 INFO L225 Difference]: With dead ends: 290 [2024-10-11 12:20:32,236 INFO L226 Difference]: Without dead ends: 288 [2024-10-11 12:20:32,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:20:32,237 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 31 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:32,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 278 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:20:32,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-11 12:20:32,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 285. [2024-10-11 12:20:32,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 190 states have (on average 1.1) internal successors, (209), 197 states have internal predecessors, (209), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-11 12:20:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 377 transitions. [2024-10-11 12:20:32,288 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 377 transitions. Word has length 81 [2024-10-11 12:20:32,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:32,289 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 377 transitions. [2024-10-11 12:20:32,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 377 transitions. [2024-10-11 12:20:32,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 12:20:32,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:32,290 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:32,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 12:20:32,290 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:32,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:32,291 INFO L85 PathProgramCache]: Analyzing trace with hash 843130934, now seen corresponding path program 1 times [2024-10-11 12:20:32,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:20:32,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301655734] [2024-10-11 12:20:32,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:32,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:20:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:20:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:20:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:20:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:20:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:20:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:20:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:20:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:20:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:20:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:20:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:20:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:20:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 12:20:33,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:20:33,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301655734] [2024-10-11 12:20:33,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301655734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:33,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:33,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 12:20:33,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990103163] [2024-10-11 12:20:33,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:33,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 12:20:33,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:20:33,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 12:20:33,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 12:20:33,081 INFO L87 Difference]: Start difference. First operand 285 states and 377 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:33,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:33,788 INFO L93 Difference]: Finished difference Result 562 states and 744 transitions. [2024-10-11 12:20:33,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 12:20:33,789 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-10-11 12:20:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:33,792 INFO L225 Difference]: With dead ends: 562 [2024-10-11 12:20:33,807 INFO L226 Difference]: Without dead ends: 344 [2024-10-11 12:20:33,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-11 12:20:33,809 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 86 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:33,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 432 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 12:20:33,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-11 12:20:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 293. [2024-10-11 12:20:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 198 states have (on average 1.101010101010101) internal successors, (218), 205 states have internal predecessors, (218), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-11 12:20:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 386 transitions. [2024-10-11 12:20:33,867 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 386 transitions. Word has length 81 [2024-10-11 12:20:33,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:33,868 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 386 transitions. [2024-10-11 12:20:33,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 386 transitions. [2024-10-11 12:20:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 12:20:33,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:33,869 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:33,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 12:20:33,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:33,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:33,871 INFO L85 PathProgramCache]: Analyzing trace with hash 464813267, now seen corresponding path program 1 times [2024-10-11 12:20:33,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:20:33,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417385635] [2024-10-11 12:20:33,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:33,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:20:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:20:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:20:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:20:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:20:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:20:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:20:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:20:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:20:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:20:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:20:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:20:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:20:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 12:20:33,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:20:33,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417385635] [2024-10-11 12:20:33,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417385635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:33,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:33,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:20:33,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646102724] [2024-10-11 12:20:33,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:33,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:20:33,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:20:33,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:20:33,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:20:33,930 INFO L87 Difference]: Start difference. First operand 293 states and 386 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:34,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:34,026 INFO L93 Difference]: Finished difference Result 616 states and 815 transitions. [2024-10-11 12:20:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:20:34,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-10-11 12:20:34,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:34,031 INFO L225 Difference]: With dead ends: 616 [2024-10-11 12:20:34,031 INFO L226 Difference]: Without dead ends: 390 [2024-10-11 12:20:34,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:20:34,033 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 47 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:34,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 97 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:20:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-11 12:20:34,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 322. [2024-10-11 12:20:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 213 states have (on average 1.0892018779342723) internal successors, (232), 222 states have internal predecessors, (232), 96 states have call successors, (96), 12 states have call predecessors, (96), 12 states have return successors, (96), 87 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 12:20:34,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 424 transitions. [2024-10-11 12:20:34,119 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 424 transitions. Word has length 83 [2024-10-11 12:20:34,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:34,119 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 424 transitions. [2024-10-11 12:20:34,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:34,119 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 424 transitions. [2024-10-11 12:20:34,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 12:20:34,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:34,121 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:34,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 12:20:34,121 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:34,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:34,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1638749302, now seen corresponding path program 1 times [2024-10-11 12:20:34,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:20:34,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014444735] [2024-10-11 12:20:34,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:34,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:20:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:20:34,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:20:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:20:34,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:20:34,228 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:20:34,229 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:20:34,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 12:20:34,235 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:20:34,307 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:20:34,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:20:34 BoogieIcfgContainer [2024-10-11 12:20:34,313 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:20:34,314 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:20:34,314 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:20:34,314 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:20:34,314 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:26" (3/4) ... [2024-10-11 12:20:34,317 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:20:34,318 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:20:34,318 INFO L158 Benchmark]: Toolchain (without parser) took 9197.08ms. Allocated memory was 184.5MB in the beginning and 281.0MB in the end (delta: 96.5MB). Free memory was 127.1MB in the beginning and 241.0MB in the end (delta: -113.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:20:34,319 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 151.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:20:34,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.15ms. Allocated memory is still 184.5MB. Free memory was 127.1MB in the beginning and 113.9MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 12:20:34,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.33ms. Allocated memory is still 184.5MB. Free memory was 113.9MB in the beginning and 112.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:20:34,319 INFO L158 Benchmark]: Boogie Preprocessor took 64.13ms. Allocated memory is still 184.5MB. Free memory was 111.8MB in the beginning and 110.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:20:34,320 INFO L158 Benchmark]: RCFGBuilder took 499.30ms. Allocated memory is still 184.5MB. Free memory was 110.1MB in the beginning and 93.6MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 12:20:34,320 INFO L158 Benchmark]: TraceAbstraction took 8242.16ms. Allocated memory was 184.5MB in the beginning and 281.0MB in the end (delta: 96.5MB). Free memory was 93.0MB in the beginning and 241.0MB in the end (delta: -148.0MB). Peak memory consumption was 107.2MB. Max. memory is 16.1GB. [2024-10-11 12:20:34,321 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 281.0MB. Free memory is still 241.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:20:34,323 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.17ms. Allocated memory is still 184.5MB. Free memory is still 151.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.15ms. Allocated memory is still 184.5MB. Free memory was 127.1MB in the beginning and 113.9MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.33ms. Allocated memory is still 184.5MB. Free memory was 113.9MB in the beginning and 112.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.13ms. Allocated memory is still 184.5MB. Free memory was 111.8MB in the beginning and 110.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 499.30ms. Allocated memory is still 184.5MB. Free memory was 110.1MB in the beginning and 93.6MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8242.16ms. Allocated memory was 184.5MB in the beginning and 281.0MB in the end (delta: 96.5MB). Free memory was 93.0MB in the beginning and 241.0MB in the end (delta: -148.0MB). Peak memory consumption was 107.2MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 281.0MB. Free memory is still 241.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 1; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 1; [L25] unsigned char var_1_4 = 0; [L26] signed char var_1_5 = 4; [L27] signed char var_1_6 = -5; [L28] signed char var_1_7 = 2; [L29] signed char var_1_8 = -32; [L68] isInitial = 1 [L69] FCALL initially() [L70] COND TRUE 1 [L71] FCALL updateLastVariables() [L72] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_uchar() [L43] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L43] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L44] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L44] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L45] var_1_3 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L46] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L47] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L47] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L48] var_1_4 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L49] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L50] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L50] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L51] var_1_5 = __VERIFIER_nondet_char() [L52] CALL assume_abort_if_not(var_1_5 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=-5, var_1_7=2, var_1_8=-32] [L52] RET assume_abort_if_not(var_1_5 >= -63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=-5, var_1_7=2, var_1_8=-32] [L53] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=-5, var_1_7=2, var_1_8=-32] [L53] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=-5, var_1_7=2, var_1_8=-32] [L54] var_1_6 = __VERIFIER_nondet_char() [L55] CALL assume_abort_if_not(var_1_6 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=2, var_1_8=-32] [L55] RET assume_abort_if_not(var_1_6 >= -63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=2, var_1_8=-32] [L56] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=2, var_1_8=-32] [L56] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=2, var_1_8=-32] [L57] var_1_7 = __VERIFIER_nondet_char() [L58] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L58] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L59] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L59] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L72] RET updateVariables() [L73] CALL step() [L33] COND TRUE (var_1_2 || var_1_3) && var_1_4 [L34] var_1_1 = (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))) VAL [isInitial=1, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L36] signed char stepLocal_0 = var_1_5; VAL [isInitial=1, stepLocal_0=38, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L37] EXPR (-100 + var_1_1) ^ var_1_1 VAL [isInitial=1, stepLocal_0=38, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L37] COND FALSE !(stepLocal_0 > ((-100 + var_1_1) ^ var_1_1)) [L73] RET step() [L74] CALL, EXPR property() [L64] EXPR (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) VAL [isInitial=1, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L64] EXPR (-100 + var_1_1) ^ var_1_1 VAL [isInitial=1, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L64] EXPR (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) VAL [isInitial=1, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L64-L65] return (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) ; [L74] RET, EXPR property() [L74] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L19] reach_error() VAL [isInitial=1, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 12, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 534 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 526 mSDsluCounter, 2318 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1555 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1237 IncrementalHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 763 mSDtfsCounter, 1237 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=322occurred in iteration=11, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 200 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 959 NumberOfCodeBlocks, 959 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 863 ConstructedInterpolants, 0 QuantifiedInterpolants, 3557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 2904/2904 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:20:34,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.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 e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:20:36,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:20:36,765 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:20:36,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:20:36,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:20:36,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:20:36,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:20:36,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:20:36,820 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:20:36,821 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:20:36,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:20:36,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:20:36,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:20:36,824 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:20:36,825 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:20:36,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:20:36,826 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:20:36,826 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:20:36,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:20:36,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:20:36,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:20:36,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:20:36,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:20:36,831 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:20:36,832 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:20:36,832 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:20:36,832 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:20:36,832 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:20:36,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:20:36,833 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:20:36,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:20:36,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:20:36,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:20:36,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:20:36,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:20:36,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:20:36,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:20:36,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:20:36,836 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:20:36,837 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:20:36,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:20:36,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:20:36,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:20:36,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:20:36,838 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:20:36,839 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 -> e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 [2024-10-11 12:20:37,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:20:37,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:20:37,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:20:37,224 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:20:37,225 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:20:37,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-10-11 12:20:38,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:20:38,905 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:20:38,906 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-10-11 12:20:38,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/151d38574/632ef9184b89474abdb5edd51716be23/FLAG8b3446d4d [2024-10-11 12:20:38,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/151d38574/632ef9184b89474abdb5edd51716be23 [2024-10-11 12:20:38,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:20:38,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:20:38,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:20:38,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:20:38,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:20:38,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:38" (1/1) ... [2024-10-11 12:20:38,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fc2168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:38, skipping insertion in model container [2024-10-11 12:20:38,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:38" (1/1) ... [2024-10-11 12:20:38,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:20:39,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_amount10_file-60.i[915,928] [2024-10-11 12:20:39,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:20:39,265 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:20:39,278 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_amount10_file-60.i[915,928] [2024-10-11 12:20:39,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:20:39,316 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:20:39,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:39 WrapperNode [2024-10-11 12:20:39,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:20:39,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:20:39,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:20:39,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:20:39,326 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:20:39" (1/1) ... [2024-10-11 12:20:39,338 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:20:39" (1/1) ... [2024-10-11 12:20:39,360 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2024-10-11 12:20:39,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:20:39,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:20:39,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:20:39,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:20:39,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:39" (1/1) ... [2024-10-11 12:20:39,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:39" (1/1) ... [2024-10-11 12:20:39,374 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:39" (1/1) ... [2024-10-11 12:20:39,403 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:20:39,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:39" (1/1) ... [2024-10-11 12:20:39,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:39" (1/1) ... [2024-10-11 12:20:39,410 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:39" (1/1) ... [2024-10-11 12:20:39,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:39" (1/1) ... [2024-10-11 12:20:39,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:39" (1/1) ... [2024-10-11 12:20:39,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:39" (1/1) ... [2024-10-11 12:20:39,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:20:39,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:20:39,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:20:39,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:20:39,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:39" (1/1) ... [2024-10-11 12:20:39,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:20:39,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:20:39,473 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:20:39,476 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:20:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:20:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:20:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:20:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:20:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:20:39,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:20:39,593 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:20:39,596 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:20:39,859 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 12:20:39,859 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:20:39,932 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:20:39,933 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:20:39,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:39 BoogieIcfgContainer [2024-10-11 12:20:39,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:20:39,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:20:39,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:20:39,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:20:39,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:20:38" (1/3) ... [2024-10-11 12:20:39,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376043bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:39, skipping insertion in model container [2024-10-11 12:20:39,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:39" (2/3) ... [2024-10-11 12:20:39,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376043bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:39, skipping insertion in model container [2024-10-11 12:20:39,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:39" (3/3) ... [2024-10-11 12:20:39,945 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-60.i [2024-10-11 12:20:39,963 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:20:39,963 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:20:40,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:20:40,047 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;@6d3faad8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:20:40,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:20:40,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 12:20:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 12:20:40,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:40,063 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:40,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:40,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:40,070 INFO L85 PathProgramCache]: Analyzing trace with hash -238086645, now seen corresponding path program 1 times [2024-10-11 12:20:40,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:20:40,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772558502] [2024-10-11 12:20:40,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:40,086 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:20:40,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:20:40,091 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:20:40,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 12:20:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:40,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:20:40,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:20:40,305 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-10-11 12:20:40,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:20:40,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:20:40,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772558502] [2024-10-11 12:20:40,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772558502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:40,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:40,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:20:40,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390113899] [2024-10-11 12:20:40,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:40,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:20:40,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:20:40,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:20:40,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:20:40,348 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:40,387 INFO L93 Difference]: Finished difference Result 65 states and 110 transitions. [2024-10-11 12:20:40,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:20:40,392 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2024-10-11 12:20:40,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:40,400 INFO L225 Difference]: With dead ends: 65 [2024-10-11 12:20:40,400 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 12:20:40,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 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:20:40,409 INFO L432 NwaCegarLoop]: 42 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, 42 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:20:40,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:20:40,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 12:20:40,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 12:20:40,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 12:20:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2024-10-11 12:20:40,458 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 74 [2024-10-11 12:20:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:40,459 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2024-10-11 12:20:40,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2024-10-11 12:20:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 12:20:40,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:40,464 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:40,474 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 (2)] Forceful destruction successful, exit code 0 [2024-10-11 12:20:40,665 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:20:40,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:40,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:40,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2086146549, now seen corresponding path program 1 times [2024-10-11 12:20:40,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:20:40,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916263154] [2024-10-11 12:20:40,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:40,669 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:20:40,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:20:40,672 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:20:40,674 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:20:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:40,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 12:20:40,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:20:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 12:20:43,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:20:43,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:20:43,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916263154] [2024-10-11 12:20:43,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916263154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:43,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:43,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:20:43,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771517178] [2024-10-11 12:20:43,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:43,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:20:43,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:20:43,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:20:43,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:20:43,574 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:43,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:43,821 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2024-10-11 12:20:43,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:20:43,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2024-10-11 12:20:43,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:43,824 INFO L225 Difference]: With dead ends: 72 [2024-10-11 12:20:43,824 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 12:20:43,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:20:43,827 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 54 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:43,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 148 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:20:43,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 12:20:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2024-10-11 12:20:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 12:20:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2024-10-11 12:20:43,849 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 74 [2024-10-11 12:20:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:43,850 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2024-10-11 12:20:43,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2024-10-11 12:20:43,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 12:20:43,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:43,854 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:43,860 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:20:44,054 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:20:44,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:44,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:44,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2086086967, now seen corresponding path program 1 times [2024-10-11 12:20:44,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:20:44,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452819725] [2024-10-11 12:20:44,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:44,057 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:20:44,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:20:44,060 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:20:44,061 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:20:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:44,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 12:20:44,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:20:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 150 proven. 24 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-11 12:20:46,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:20:48,325 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 12:20:48,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:20:48,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452819725] [2024-10-11 12:20:48,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452819725] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 12:20:48,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 12:20:48,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-10-11 12:20:48,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803716767] [2024-10-11 12:20:48,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:48,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:20:48,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:20:48,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:20:48,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-11 12:20:48,331 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:49,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:49,021 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2024-10-11 12:20:49,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 12:20:49,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2024-10-11 12:20:49,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:49,026 INFO L225 Difference]: With dead ends: 83 [2024-10-11 12:20:49,026 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 12:20:49,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-10-11 12:20:49,028 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 53 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:49,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 157 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 12:20:49,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 12:20:49,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 50. [2024-10-11 12:20:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 12:20:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2024-10-11 12:20:49,045 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 74 [2024-10-11 12:20:49,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:49,046 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 69 transitions. [2024-10-11 12:20:49,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:49,047 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2024-10-11 12:20:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 12:20:49,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:49,048 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:49,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 12:20:49,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:20:49,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:49,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:49,253 INFO L85 PathProgramCache]: Analyzing trace with hash -2028888247, now seen corresponding path program 1 times [2024-10-11 12:20:49,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:20:49,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716289862] [2024-10-11 12:20:49,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:49,254 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:20:49,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:20:49,257 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:20:49,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 12:20:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:49,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 12:20:49,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:20:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 12:20:50,146 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:20:50,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:20:50,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716289862] [2024-10-11 12:20:50,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716289862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:50,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:50,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:20:50,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245362112] [2024-10-11 12:20:50,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:50,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:20:50,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:20:50,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:20:50,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:20:50,149 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:50,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:50,219 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2024-10-11 12:20:50,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:20:50,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2024-10-11 12:20:50,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:50,221 INFO L225 Difference]: With dead ends: 57 [2024-10-11 12:20:50,221 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 12:20:50,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:20:50,222 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:50,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 124 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:20:50,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 12:20:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-10-11 12:20:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 12:20:50,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-11 12:20:50,235 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 74 [2024-10-11 12:20:50,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:50,236 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-11 12:20:50,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:50,236 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-10-11 12:20:50,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 12:20:50,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:50,237 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:50,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 12:20:50,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:20:50,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:50,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash -2028828665, now seen corresponding path program 1 times [2024-10-11 12:20:50,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:20:50,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204718631] [2024-10-11 12:20:50,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:50,443 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:20:50,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:20:50,446 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:20:50,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 12:20:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:50,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 12:20:50,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:20:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-11 12:20:50,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:20:50,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:20:50,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204718631] [2024-10-11 12:20:50,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204718631] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:20:50,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1150496066] [2024-10-11 12:20:50,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:50,853 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 12:20:50,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 12:20:50,856 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 12:20:50,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-11 12:20:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:50,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 12:20:50,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:20:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-11 12:20:51,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:20:51,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1150496066] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:20:51,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 12:20:51,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-10-11 12:20:51,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476144788] [2024-10-11 12:20:51,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 12:20:51,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 12:20:51,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:20:51,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 12:20:51,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 12:20:51,215 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 12:20:51,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:51,433 INFO L93 Difference]: Finished difference Result 153 states and 208 transitions. [2024-10-11 12:20:51,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 12:20:51,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 74 [2024-10-11 12:20:51,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:51,435 INFO L225 Difference]: With dead ends: 153 [2024-10-11 12:20:51,435 INFO L226 Difference]: Without dead ends: 102 [2024-10-11 12:20:51,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-11 12:20:51,436 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:51,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 105 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:20:51,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-11 12:20:51,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-10-11 12:20:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 58 states have internal predecessors, (61), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 12:20:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 133 transitions. [2024-10-11 12:20:51,463 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 133 transitions. Word has length 74 [2024-10-11 12:20:51,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:51,464 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 133 transitions. [2024-10-11 12:20:51,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 12:20:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 133 transitions. [2024-10-11 12:20:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 12:20:51,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:51,470 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:20:51,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 12:20:51,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-10-11 12:20:51,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 12:20:51,871 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:51,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:51,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1940362940, now seen corresponding path program 1 times [2024-10-11 12:20:51,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:20:51,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212045916] [2024-10-11 12:20:51,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:51,873 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:20:51,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:20:51,875 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:20:51,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 12:20:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:51,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 12:20:51,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:20:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 728 proven. 195 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-10-11 12:20:54,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:20:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2024-10-11 12:20:57,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:20:57,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212045916] [2024-10-11 12:20:57,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212045916] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 12:20:57,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 12:20:57,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2024-10-11 12:20:57,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630570874] [2024-10-11 12:20:57,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:57,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:20:57,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:20:57,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:20:57,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-10-11 12:20:57,687 INFO L87 Difference]: Start difference. First operand 98 states and 133 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:59,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:59,188 INFO L93 Difference]: Finished difference Result 100 states and 135 transitions. [2024-10-11 12:20:59,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 12:20:59,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 147 [2024-10-11 12:20:59,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:59,190 INFO L225 Difference]: With dead ends: 100 [2024-10-11 12:20:59,191 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 12:20:59,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-10-11 12:20:59,192 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:59,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 156 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 12:20:59,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 12:20:59,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 12:20:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 12:20:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 12:20:59,194 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147 [2024-10-11 12:20:59,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:59,195 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 12:20:59,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:20:59,195 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 12:20:59,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 12:20:59,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:20:59,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-11 12:20:59,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:20:59,404 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 12:20:59,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 12:21:01,046 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:21:01,054 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-10-11 12:21:01,057 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-10-11 12:21:01,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:21:01 BoogieIcfgContainer [2024-10-11 12:21:01,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:21:01,065 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:21:01,065 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:21:01,065 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:21:01,066 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:39" (3/4) ... [2024-10-11 12:21:01,068 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 12:21:01,072 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 12:21:01,076 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-11 12:21:01,076 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-11 12:21:01,076 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 12:21:01,076 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 12:21:01,182 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 12:21:01,183 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 12:21:01,183 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:21:01,184 INFO L158 Benchmark]: Toolchain (without parser) took 22241.05ms. Allocated memory was 69.2MB in the beginning and 408.9MB in the end (delta: 339.7MB). Free memory was 38.1MB in the beginning and 231.5MB in the end (delta: -193.4MB). Peak memory consumption was 147.0MB. Max. memory is 16.1GB. [2024-10-11 12:21:01,184 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 46.1MB. Free memory is still 26.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:21:01,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.07ms. Allocated memory is still 69.2MB. Free memory was 37.9MB in the beginning and 42.6MB in the end (delta: -4.7MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-10-11 12:21:01,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.15ms. Allocated memory is still 69.2MB. Free memory was 42.6MB in the beginning and 40.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:21:01,185 INFO L158 Benchmark]: Boogie Preprocessor took 71.96ms. Allocated memory is still 69.2MB. Free memory was 40.8MB in the beginning and 38.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:21:01,186 INFO L158 Benchmark]: RCFGBuilder took 499.85ms. Allocated memory is still 69.2MB. Free memory was 38.5MB in the beginning and 39.1MB in the end (delta: -602.3kB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-10-11 12:21:01,186 INFO L158 Benchmark]: TraceAbstraction took 21127.53ms. Allocated memory was 69.2MB in the beginning and 408.9MB in the end (delta: 339.7MB). Free memory was 38.4MB in the beginning and 236.7MB in the end (delta: -198.3MB). Peak memory consumption was 237.6MB. Max. memory is 16.1GB. [2024-10-11 12:21:01,186 INFO L158 Benchmark]: Witness Printer took 118.13ms. Allocated memory is still 408.9MB. Free memory was 236.7MB in the beginning and 231.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 12:21:01,188 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.23ms. Allocated memory is still 46.1MB. Free memory is still 26.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.07ms. Allocated memory is still 69.2MB. Free memory was 37.9MB in the beginning and 42.6MB in the end (delta: -4.7MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.15ms. Allocated memory is still 69.2MB. Free memory was 42.6MB in the beginning and 40.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.96ms. Allocated memory is still 69.2MB. Free memory was 40.8MB in the beginning and 38.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 499.85ms. Allocated memory is still 69.2MB. Free memory was 38.5MB in the beginning and 39.1MB in the end (delta: -602.3kB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * TraceAbstraction took 21127.53ms. Allocated memory was 69.2MB in the beginning and 408.9MB in the end (delta: 339.7MB). Free memory was 38.4MB in the beginning and 236.7MB in the end (delta: -198.3MB). Peak memory consumption was 237.6MB. Max. memory is 16.1GB. * Witness Printer took 118.13ms. Allocated memory is still 408.9MB. Free memory was 236.7MB in the beginning and 231.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.4s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146 mSDsluCounter, 732 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 458 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 364 IncrementalHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 274 mSDtfsCounter, 364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 883 GetRequests, 825 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=5, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 56 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.3s InterpolantComputationTime, 591 NumberOfCodeBlocks, 591 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 803 ConstructedInterpolants, 80 QuantifiedInterpolants, 5410 SizeOfPredicates, 49 NumberOfNonLiveVariables, 942 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 3855/4104 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((var_1_1 != 1) || (0 != cond)) RESULT: Ultimate proved your program to be correct! [2024-10-11 12:21:01,245 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 Writing output log to file Ultimate.log Result: TRUE