./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-32.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ca47567d960d28eb558b95d7dc19a5acbfff015e985881cbaf1273ae96c48df --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:41:12,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:41:12,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:41:12,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:41:12,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:41:12,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:41:12,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:41:12,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:41:12,801 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:41:12,802 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:41:12,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:41:12,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:41:12,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:41:12,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:41:12,807 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:41:12,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:41:12,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:41:12,808 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:41:12,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:41:12,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:41:12,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:41:12,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:41:12,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:41:12,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:41:12,814 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:41:12,814 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:41:12,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:41:12,815 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:41:12,815 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:41:12,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:41:12,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:41:12,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:41:12,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:41:12,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:41:12,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:41:12,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:41:12,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:41:12,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:41:12,818 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:41:12,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:41:12,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:41:12,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:41:12,820 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ca47567d960d28eb558b95d7dc19a5acbfff015e985881cbaf1273ae96c48df [2024-11-10 06:41:13,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:41:13,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:41:13,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:41:13,160 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:41:13,160 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:41:13,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-32.i [2024-11-10 06:41:14,822 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:41:15,060 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:41:15,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-32.i [2024-11-10 06:41:15,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d03389a77/62f40208acf64a13bedefcff7ca8027d/FLAG334b1e649 [2024-11-10 06:41:15,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d03389a77/62f40208acf64a13bedefcff7ca8027d [2024-11-10 06:41:15,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:41:15,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:41:15,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:41:15,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:41:15,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:41:15,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:41:15" (1/1) ... [2024-11-10 06:41:15,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a19a70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:41:15, skipping insertion in model container [2024-11-10 06:41:15,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:41:15" (1/1) ... [2024-11-10 06:41:15,127 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:41:15,292 WARN L250 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_floatingpointinfluence_has-floats_file-32.i[917,930] [2024-11-10 06:41:15,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:41:15,393 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:41:15,431 WARN L250 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_floatingpointinfluence_has-floats_file-32.i[917,930] [2024-11-10 06:41:15,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:41:15,481 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:41:15,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:41:15 WrapperNode [2024-11-10 06:41:15,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:41:15,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:41:15,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:41:15,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:41:15,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:41:15" (1/1) ... [2024-11-10 06:41:15,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:41:15" (1/1) ... [2024-11-10 06:41:15,564 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-11-10 06:41:15,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:41:15,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:41:15,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:41:15,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:41:15,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:41:15" (1/1) ... [2024-11-10 06:41:15,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:41:15" (1/1) ... [2024-11-10 06:41:15,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:41:15" (1/1) ... [2024-11-10 06:41:15,607 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-11-10 06:41:15,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:41:15" (1/1) ... [2024-11-10 06:41:15,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:41:15" (1/1) ... [2024-11-10 06:41:15,622 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:41:15" (1/1) ... [2024-11-10 06:41:15,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:41:15" (1/1) ... [2024-11-10 06:41:15,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:41:15" (1/1) ... [2024-11-10 06:41:15,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:41:15" (1/1) ... [2024-11-10 06:41:15,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:41:15,631 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:41:15,631 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:41:15,631 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:41:15,632 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:41:15" (1/1) ... [2024-11-10 06:41:15,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:41:15,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:41:15,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:41:15,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:41:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:41:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:41:15,755 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:41:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:41:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:41:15,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:41:15,834 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:41:15,836 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:41:16,178 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 06:41:16,180 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:41:16,198 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:41:16,198 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:41:16,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:41:16 BoogieIcfgContainer [2024-11-10 06:41:16,199 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:41:16,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:41:16,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:41:16,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:41:16,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:41:15" (1/3) ... [2024-11-10 06:41:16,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237e90ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:41:16, skipping insertion in model container [2024-11-10 06:41:16,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:41:15" (2/3) ... [2024-11-10 06:41:16,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237e90ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:41:16, skipping insertion in model container [2024-11-10 06:41:16,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:41:16" (3/3) ... [2024-11-10 06:41:16,212 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-32.i [2024-11-10 06:41:16,230 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:41:16,231 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:41:16,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:41:16,318 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;@530ae463, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:41:16,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:41:16,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 06:41:16,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 06:41:16,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:41:16,346 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:41:16,347 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:41:16,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:41:16,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1883652059, now seen corresponding path program 1 times [2024-11-10 06:41:16,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:41:16,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663893583] [2024-11-10 06:41:16,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:41:16,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:41:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:41:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:41:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:41:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:41:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:41:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:41:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:41:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:41:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:41:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:41:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:41:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:41:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:41:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:41:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:41:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:41:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:41:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:41:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 06:41:16,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:41:16,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663893583] [2024-11-10 06:41:16,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663893583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:41:16,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:41:16,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:41:16,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264548384] [2024-11-10 06:41:16,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:41:16,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:41:16,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:41:16,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:41:16,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:41:16,859 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 06:41:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:41:16,883 INFO L93 Difference]: Finished difference Result 108 states and 181 transitions. [2024-11-10 06:41:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:41:16,888 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2024-11-10 06:41:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:41:16,899 INFO L225 Difference]: With dead ends: 108 [2024-11-10 06:41:16,900 INFO L226 Difference]: Without dead ends: 53 [2024-11-10 06:41:16,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:41:16,908 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:41:16,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:41:16,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-10 06:41:16,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-10 06:41:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 06:41:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2024-11-10 06:41:16,972 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 115 [2024-11-10 06:41:16,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:41:16,973 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2024-11-10 06:41:16,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 06:41:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2024-11-10 06:41:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 06:41:16,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:41:16,977 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:41:16,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:41:16,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:41:16,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:41:16,978 INFO L85 PathProgramCache]: Analyzing trace with hash 967138181, now seen corresponding path program 1 times [2024-11-10 06:41:16,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:41:16,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308695579] [2024-11-10 06:41:16,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:41:16,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:41:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:41:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:41:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:41:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:41:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:41:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:41:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:41:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:41:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:41:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:41:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:41:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:41:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:41:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:41:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:41:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:41:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:41:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:41:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 06:41:19,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:41:19,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308695579] [2024-11-10 06:41:19,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308695579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:41:19,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:41:19,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 06:41:19,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612982385] [2024-11-10 06:41:19,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:41:19,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 06:41:19,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:41:19,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 06:41:19,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 06:41:19,394 INFO L87 Difference]: Start difference. First operand 53 states and 77 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 06:41:19,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:41:19,729 INFO L93 Difference]: Finished difference Result 92 states and 125 transitions. [2024-11-10 06:41:19,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 06:41:19,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-10 06:41:19,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:41:19,732 INFO L225 Difference]: With dead ends: 92 [2024-11-10 06:41:19,732 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 06:41:19,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 06:41:19,735 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 53 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:41:19,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 308 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:41:19,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 06:41:19,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 60. [2024-11-10 06:41:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 06:41:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 86 transitions. [2024-11-10 06:41:19,752 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 86 transitions. Word has length 115 [2024-11-10 06:41:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:41:19,754 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 86 transitions. [2024-11-10 06:41:19,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 06:41:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 86 transitions. [2024-11-10 06:41:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 06:41:19,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:41:19,759 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:41:19,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:41:19,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:41:19,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:41:19,761 INFO L85 PathProgramCache]: Analyzing trace with hash 770624676, now seen corresponding path program 1 times [2024-11-10 06:41:19,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:41:19,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613143345] [2024-11-10 06:41:19,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:41:19,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:41:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:41:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:41:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:41:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:41:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:41:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:41:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:41:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:41:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:41:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:41:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:41:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:41:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:41:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:41:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:41:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:41:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:41:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:41:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:41:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 06:41:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:41:19,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613143345] [2024-11-10 06:41:19,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613143345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:41:19,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:41:19,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:41:19,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237825044] [2024-11-10 06:41:19,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:41:19,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:41:19,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:41:19,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:41:19,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:41:19,957 INFO L87 Difference]: Start difference. First operand 60 states and 86 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 06:41:20,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:41:20,063 INFO L93 Difference]: Finished difference Result 115 states and 166 transitions. [2024-11-10 06:41:20,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:41:20,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-10 06:41:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:41:20,072 INFO L225 Difference]: With dead ends: 115 [2024-11-10 06:41:20,072 INFO L226 Difference]: Without dead ends: 58 [2024-11-10 06:41:20,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:41:20,076 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:41:20,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 72 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:41:20,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-10 06:41:20,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-10 06:41:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 06:41:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 82 transitions. [2024-11-10 06:41:20,095 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 82 transitions. Word has length 115 [2024-11-10 06:41:20,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:41:20,096 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 82 transitions. [2024-11-10 06:41:20,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 06:41:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 82 transitions. [2024-11-10 06:41:20,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 06:41:20,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:41:20,101 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:41:20,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:41:20,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:41:20,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:41:20,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1091870781, now seen corresponding path program 1 times [2024-11-10 06:41:20,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:41:20,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074744288] [2024-11-10 06:41:20,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:41:20,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:41:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat