./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_floatingpointinfluence_no-floats_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.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 8d6e232da9a83d5f71424a24404b69fd0e4337eea9ca06f51ad2ecca1f048cf0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:36:19,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:36:19,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:36:19,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:36:19,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:36:19,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:36:19,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:36:19,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:36:19,127 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:36:19,127 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:36:19,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:36:19,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:36:19,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:36:19,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:36:19,131 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:36:19,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:36:19,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:36:19,132 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:36:19,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:36:19,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:36:19,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:36:19,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:36:19,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:36:19,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:36:19,137 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:36:19,137 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:36:19,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:36:19,137 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:36:19,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:36:19,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:36:19,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:36:19,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:36:19,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:36:19,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:36:19,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:36:19,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:36:19,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:36:19,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:36:19,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:36:19,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:36:19,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:36:19,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:36:19,141 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 -> 8d6e232da9a83d5f71424a24404b69fd0e4337eea9ca06f51ad2ecca1f048cf0 [2024-10-13 03:36:19,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:36:19,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:36:19,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:36:19,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:36:19,379 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:36:19,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i [2024-10-13 03:36:20,620 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:36:20,779 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:36:20,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i [2024-10-13 03:36:20,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b527f3724/6995d93ca24142ada03b735efb4f9709/FLAG83d040a36 [2024-10-13 03:36:20,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b527f3724/6995d93ca24142ada03b735efb4f9709 [2024-10-13 03:36:20,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:36:20,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:36:20,801 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:36:20,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:36:20,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:36:20,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:36:20" (1/1) ... [2024-10-13 03:36:20,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb9abee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:20, skipping insertion in model container [2024-10-13 03:36:20,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:36:20" (1/1) ... [2024-10-13 03:36:20,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:36:20,947 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_floatingpointinfluence_no-floats_file-36.i[916,929] [2024-10-13 03:36:20,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:36:20,990 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:36:20,998 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_floatingpointinfluence_no-floats_file-36.i[916,929] [2024-10-13 03:36:21,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:36:21,024 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:36:21,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:21 WrapperNode [2024-10-13 03:36:21,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:36:21,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:36:21,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:36:21,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:36:21,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:21" (1/1) ... [2024-10-13 03:36:21,036 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:21" (1/1) ... [2024-10-13 03:36:21,056 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-10-13 03:36:21,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:36:21,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:36:21,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:36:21,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:36:21,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:21" (1/1) ... [2024-10-13 03:36:21,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:21" (1/1) ... [2024-10-13 03:36:21,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:21" (1/1) ... [2024-10-13 03:36:21,078 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-13 03:36:21,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:21" (1/1) ... [2024-10-13 03:36:21,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:21" (1/1) ... [2024-10-13 03:36:21,082 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:21" (1/1) ... [2024-10-13 03:36:21,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:21" (1/1) ... [2024-10-13 03:36:21,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:21" (1/1) ... [2024-10-13 03:36:21,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:21" (1/1) ... [2024-10-13 03:36:21,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:36:21,089 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:36:21,089 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:36:21,089 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:36:21,090 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:21" (1/1) ... [2024-10-13 03:36:21,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:36:21,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:36:21,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:36:21,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:36:21,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:36:21,151 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:36:21,152 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:36:21,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:36:21,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:36:21,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:36:21,205 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:36:21,206 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:36:21,448 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 03:36:21,448 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:36:21,481 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:36:21,481 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:36:21,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:36:21 BoogieIcfgContainer [2024-10-13 03:36:21,482 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:36:21,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:36:21,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:36:21,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:36:21,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:36:20" (1/3) ... [2024-10-13 03:36:21,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731fa39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:36:21, skipping insertion in model container [2024-10-13 03:36:21,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:21" (2/3) ... [2024-10-13 03:36:21,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731fa39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:36:21, skipping insertion in model container [2024-10-13 03:36:21,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:36:21" (3/3) ... [2024-10-13 03:36:21,488 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-36.i [2024-10-13 03:36:21,500 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:36:21,500 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:36:21,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:36:21,554 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;@3d1f150e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:36:21,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:36:21,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 03:36:21,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 03:36:21,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:36:21,566 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:36:21,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:36:21,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:36:21,570 INFO L85 PathProgramCache]: Analyzing trace with hash -574449767, now seen corresponding path program 1 times [2024-10-13 03:36:21,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:36:21,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920854359] [2024-10-13 03:36:21,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:36:21,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:36:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:21,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:36:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:21,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:36:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:21,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:36:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:21,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:36:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:21,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:36:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:21,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:36:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:21,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:36:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:21,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:36:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:21,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:36:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:21,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:36:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:21,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:36:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:21,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:36:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:21,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:36:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:21,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:36:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:21,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:36:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:21,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:36:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:36:21,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:36:21,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920854359] [2024-10-13 03:36:21,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920854359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:36:21,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:36:21,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:36:21,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428876336] [2024-10-13 03:36:21,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:36:21,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:36:21,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:36:21,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:36:21,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:36:21,908 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 03:36:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:36:21,936 INFO L93 Difference]: Finished difference Result 101 states and 174 transitions. [2024-10-13 03:36:21,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:36:21,939 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2024-10-13 03:36:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:36:21,944 INFO L225 Difference]: With dead ends: 101 [2024-10-13 03:36:21,945 INFO L226 Difference]: Without dead ends: 50 [2024-10-13 03:36:21,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-13 03:36:21,953 INFO L432 NwaCegarLoop]: 72 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, 72 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-13 03:36:21,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:36:21,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-13 03:36:21,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-13 03:36:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 03:36:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 75 transitions. [2024-10-13 03:36:21,986 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 75 transitions. Word has length 101 [2024-10-13 03:36:21,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:36:21,986 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 75 transitions. [2024-10-13 03:36:21,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 03:36:21,987 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 75 transitions. [2024-10-13 03:36:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 03:36:21,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:36:21,990 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:36:21,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:36:21,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:36:21,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:36:21,991 INFO L85 PathProgramCache]: Analyzing trace with hash -207521895, now seen corresponding path program 1 times [2024-10-13 03:36:21,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:36:21,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045153342] [2024-10-13 03:36:21,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:36:21,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:36:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:36:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:36:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:36:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:36:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:36:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:36:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:36:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:36:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:36:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:36:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:36:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:36:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:36:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:36:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:36:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:36:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:36:22,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:36:22,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045153342] [2024-10-13 03:36:22,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045153342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:36:22,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:36:22,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:36:22,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332135801] [2024-10-13 03:36:22,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:36:22,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:36:22,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:36:22,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:36:22,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:36:22,218 INFO L87 Difference]: Start difference. First operand 50 states and 75 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:36:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:36:22,268 INFO L93 Difference]: Finished difference Result 100 states and 151 transitions. [2024-10-13 03:36:22,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:36:22,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2024-10-13 03:36:22,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:36:22,271 INFO L225 Difference]: With dead ends: 100 [2024-10-13 03:36:22,272 INFO L226 Difference]: Without dead ends: 51 [2024-10-13 03:36:22,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-13 03:36:22,273 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:36:22,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:36:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-13 03:36:22,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-13 03:36:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 03:36:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 76 transitions. [2024-10-13 03:36:22,287 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 76 transitions. Word has length 101 [2024-10-13 03:36:22,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:36:22,288 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 76 transitions. [2024-10-13 03:36:22,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:36:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2024-10-13 03:36:22,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 03:36:22,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:36:22,293 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:36:22,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:36:22,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:36:22,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:36:22,294 INFO L85 PathProgramCache]: Analyzing trace with hash -600548905, now seen corresponding path program 1 times [2024-10-13 03:36:22,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:36:22,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360176882] [2024-10-13 03:36:22,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:36:22,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:36:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:36:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:36:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:36:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:36:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:36:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:36:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:36:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:36:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:36:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:36:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:36:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:36:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:36:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:36:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:36:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:36:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,552 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:36:22,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:36:22,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360176882] [2024-10-13 03:36:22,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360176882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:36:22,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:36:22,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:36:22,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997560536] [2024-10-13 03:36:22,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:36:22,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:36:22,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:36:22,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:36:22,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:36:22,556 INFO L87 Difference]: Start difference. First operand 51 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:36:22,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:36:22,681 INFO L93 Difference]: Finished difference Result 151 states and 226 transitions. [2024-10-13 03:36:22,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:36:22,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2024-10-13 03:36:22,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:36:22,684 INFO L225 Difference]: With dead ends: 151 [2024-10-13 03:36:22,685 INFO L226 Difference]: Without dead ends: 101 [2024-10-13 03:36:22,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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-13 03:36:22,686 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 48 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:36:22,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 190 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:36:22,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-13 03:36:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2024-10-13 03:36:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 58 states have internal predecessors, (77), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 03:36:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 141 transitions. [2024-10-13 03:36:22,705 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 141 transitions. Word has length 101 [2024-10-13 03:36:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:36:22,706 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 141 transitions. [2024-10-13 03:36:22,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:36:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 141 transitions. [2024-10-13 03:36:22,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-13 03:36:22,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:36:22,711 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:36:22,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:36:22,711 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:36:22,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:36:22,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1748694661, now seen corresponding path program 1 times [2024-10-13 03:36:22,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:36:22,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484923139] [2024-10-13 03:36:22,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:36:22,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:36:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:36:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:36:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:36:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:36:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:36:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:36:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:36:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:36:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:36:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:36:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:36:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:36:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:36:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:36:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:36:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:36:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:36:22,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:36:22,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484923139] [2024-10-13 03:36:22,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484923139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:36:22,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:36:22,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:36:22,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075507386] [2024-10-13 03:36:22,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:36:22,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:36:22,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:36:22,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:36:22,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:36:22,970 INFO L87 Difference]: Start difference. First operand 93 states and 141 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:36:23,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:36:23,151 INFO L93 Difference]: Finished difference Result 254 states and 383 transitions. [2024-10-13 03:36:23,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:36:23,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2024-10-13 03:36:23,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:36:23,155 INFO L225 Difference]: With dead ends: 254 [2024-10-13 03:36:23,156 INFO L226 Difference]: Without dead ends: 204 [2024-10-13 03:36:23,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:36:23,159 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 139 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:36:23,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 340 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:36:23,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-13 03:36:23,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 107. [2024-10-13 03:36:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 03:36:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 163 transitions. [2024-10-13 03:36:23,181 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 163 transitions. Word has length 102 [2024-10-13 03:36:23,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:36:23,182 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 163 transitions. [2024-10-13 03:36:23,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:36:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 163 transitions. [2024-10-13 03:36:23,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 03:36:23,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:36:23,185 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:36:23,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:36:23,186 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:36:23,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:36:23,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1620881132, now seen corresponding path program 1 times [2024-10-13 03:36:23,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:36:23,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913730699] [2024-10-13 03:36:23,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:36:23,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:36:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:36:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:36:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:36:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:36:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:36:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:36:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:36:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:36:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:36:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:36:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:36:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:36:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:36:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:36:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:36:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:36:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:36:23,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:36:23,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913730699] [2024-10-13 03:36:23,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913730699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:36:23,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:36:23,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:36:23,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061858042] [2024-10-13 03:36:23,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:36:23,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:36:23,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:36:23,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:36:23,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:36:23,409 INFO L87 Difference]: Start difference. First operand 107 states and 163 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:36:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:36:23,460 INFO L93 Difference]: Finished difference Result 212 states and 319 transitions. [2024-10-13 03:36:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:36:23,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2024-10-13 03:36:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:36:23,464 INFO L225 Difference]: With dead ends: 212 [2024-10-13 03:36:23,464 INFO L226 Difference]: Without dead ends: 155 [2024-10-13 03:36:23,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-13 03:36:23,465 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 61 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:36:23,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 212 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:36:23,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-13 03:36:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 97. [2024-10-13 03:36:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 03:36:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 145 transitions. [2024-10-13 03:36:23,487 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 145 transitions. Word has length 103 [2024-10-13 03:36:23,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:36:23,487 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 145 transitions. [2024-10-13 03:36:23,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:36:23,488 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 145 transitions. [2024-10-13 03:36:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 03:36:23,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:36:23,488 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:36:23,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:36:23,489 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:36:23,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:36:23,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1146299088, now seen corresponding path program 1 times [2024-10-13 03:36:23,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:36:23,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887023972] [2024-10-13 03:36:23,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:36:23,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:36:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:36:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:36:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:36:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:36:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:36:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:36:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:36:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:36:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:36:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:36:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:36:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:36:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:36:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:36:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:36:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:36:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:23,580 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:36:23,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:36:23,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887023972] [2024-10-13 03:36:23,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887023972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:36:23,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:36:23,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:36:23,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933666512] [2024-10-13 03:36:23,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:36:23,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:36:23,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:36:23,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:36:23,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:36:23,582 INFO L87 Difference]: Start difference. First operand 97 states and 145 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:36:23,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:36:23,602 INFO L93 Difference]: Finished difference Result 148 states and 218 transitions. [2024-10-13 03:36:23,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:36:23,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-10-13 03:36:23,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:36:23,603 INFO L225 Difference]: With dead ends: 148 [2024-10-13 03:36:23,603 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 03:36:23,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-13 03:36:23,604 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:36:23,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:36:23,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 03:36:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-13 03:36:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 03:36:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2024-10-13 03:36:23,617 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 104 [2024-10-13 03:36:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:36:23,617 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2024-10-13 03:36:23,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:36:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2024-10-13 03:36:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 03:36:23,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:36:23,618 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:36:23,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:36:23,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:36:23,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:36:23,622 INFO L85 PathProgramCache]: Analyzing trace with hash -652406970, now seen corresponding path program 1 times [2024-10-13 03:36:23,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:36:23,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512891849] [2024-10-13 03:36:23,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:36:23,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:36:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:36:23,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:36:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:36:23,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:36:23,723 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:36:23,724 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:36:23,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 03:36:23,728 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:36:23,794 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:36:23,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:36:23 BoogieIcfgContainer [2024-10-13 03:36:23,796 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:36:23,797 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:36:23,797 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:36:23,797 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:36:23,797 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:36:21" (3/4) ... [2024-10-13 03:36:23,798 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:36:23,799 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:36:23,799 INFO L158 Benchmark]: Toolchain (without parser) took 2999.72ms. Allocated memory was 148.9MB in the beginning and 188.7MB in the end (delta: 39.8MB). Free memory was 94.8MB in the beginning and 150.0MB in the end (delta: -55.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:36:23,800 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:36:23,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.60ms. Allocated memory is still 148.9MB. Free memory was 94.8MB in the beginning and 81.0MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 03:36:23,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.83ms. Allocated memory is still 148.9MB. Free memory was 80.7MB in the beginning and 78.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:36:23,800 INFO L158 Benchmark]: Boogie Preprocessor took 30.91ms. Allocated memory is still 148.9MB. Free memory was 78.4MB in the beginning and 76.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:36:23,800 INFO L158 Benchmark]: RCFGBuilder took 392.96ms. Allocated memory is still 148.9MB. Free memory was 76.0MB in the beginning and 112.6MB in the end (delta: -36.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-10-13 03:36:23,801 INFO L158 Benchmark]: TraceAbstraction took 2312.80ms. Allocated memory was 148.9MB in the beginning and 188.7MB in the end (delta: 39.8MB). Free memory was 111.8MB in the beginning and 151.1MB in the end (delta: -39.2MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2024-10-13 03:36:23,801 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 188.7MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:36:23,804 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 148.9MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.60ms. Allocated memory is still 148.9MB. Free memory was 94.8MB in the beginning and 81.0MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.83ms. Allocated memory is still 148.9MB. Free memory was 80.7MB in the beginning and 78.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.91ms. Allocated memory is still 148.9MB. Free memory was 78.4MB in the beginning and 76.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 392.96ms. Allocated memory is still 148.9MB. Free memory was 76.0MB in the beginning and 112.6MB in the end (delta: -36.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2312.80ms. Allocated memory was 148.9MB in the beginning and 188.7MB in the end (delta: 39.8MB). Free memory was 111.8MB in the beginning and 151.1MB in the end (delta: -39.2MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 188.7MB. Free memory is still 150.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 to_int at line 100, overapproximation of shiftRight at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1; [L23] signed long int var_1_3 = 999999999; [L24] unsigned char var_1_4 = 0; [L25] signed long int var_1_5 = 4; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_9 = 1; [L28] signed long int var_1_10 = 64; [L29] signed long int var_1_11 = 9; [L30] signed long int var_1_12 = 199; [L31] signed long int var_1_13 = 3; [L32] unsigned char var_1_14 = 1; [L33] unsigned char var_1_16 = 2; [L34] unsigned char last_1_var_1_14 = 1; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L97] last_1_var_1_14 = var_1_14 [L107] RET updateLastVariables() [L108] CALL updateVariables() [L71] var_1_3 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L72] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L73] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L74] var_1_4 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_5=4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_5=4, var_1_7=1, var_1_9=1] [L75] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_5=4, var_1_7=1, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L76] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L77] var_1_5 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L78] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L79] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L81] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L82] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L83] var_1_11 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L84] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L85] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L85] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L86] var_1_12 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L87] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L88] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L89] var_1_13 = __VERIFIER_nondet_long() [L90] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L90] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L91] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L92] var_1_16 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=1, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=1, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=1, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L94] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L108] RET updateVariables() [L109] CALL step() [L38] EXPR last_1_var_1_14 >> last_1_var_1_14 VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L38] COND TRUE (last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14) [L39] var_1_7 = (var_1_4 || var_1_9) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L41] COND FALSE !(var_1_13 == (- var_1_12)) [L48] var_1_14 = 0 VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L50] COND TRUE var_1_5 > var_1_3 [L51] var_1_10 = 4.6 VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L55] unsigned char stepLocal_0 = var_1_10 > var_1_10; VAL [isInitial=1, last_1_var_1_14=1, stepLocal_0=0, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L56] COND FALSE !(stepLocal_0 && var_1_7) [L67] var_1_1 = var_1_14 VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_1=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (((var_1_10 > var_1_10) && var_1_7) ? ((((((var_1_10) > ((- var_1_10))) ? (var_1_10) : ((- var_1_10)))) != var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned long int) 10u)) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? (var_1_7 == ((unsigned char) (var_1_4 || var_1_9))) : 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_1=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L100] EXPR last_1_var_1_14 >> last_1_var_1_14 VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_1=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L100] EXPR (((var_1_10 > var_1_10) && var_1_7) ? ((((((var_1_10) > ((- var_1_10))) ? (var_1_10) : ((- var_1_10)))) != var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned long int) 10u)) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? (var_1_7 == ((unsigned char) (var_1_4 || var_1_9))) : 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_1=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L100-L101] return (((((var_1_10 > var_1_10) && var_1_7) ? ((((((var_1_10) > ((- var_1_10))) ? (var_1_10) : ((- var_1_10)))) != var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned long int) 10u)) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? (var_1_7 == ((unsigned char) (var_1_4 || var_1_9))) : 1)) && ((var_1_5 > var_1_3) ? (var_1_10 == ((signed long int) 4.6)) : (var_1_10 == ((signed long int) ((((var_1_11) > (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) ? (var_1_11) : (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13)))))))))) && ((var_1_13 == (- var_1_12)) ? ((var_1_7 && var_1_7) ? (var_1_14 == ((unsigned char) var_1_16)) : (var_1_14 == ((unsigned char) var_1_16))) : (var_1_14 == ((unsigned char) 0))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=1000000001, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_1=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=1, var_1_10=1000000001, var_1_11=-1, var_1_12=-1, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_1=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 7, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 1073 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 539 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 232 IncrementalHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 534 mSDtfsCounter, 232 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=4, InterpolantAutomatonStates: 21, 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, 163 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 717 NumberOfCodeBlocks, 717 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 606 ConstructedInterpolants, 0 QuantifiedInterpolants, 694 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 2880/2880 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-13 03:36:23,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d6e232da9a83d5f71424a24404b69fd0e4337eea9ca06f51ad2ecca1f048cf0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:36:25,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:36:25,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:36:25,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:36:25,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:36:25,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:36:25,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:36:25,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:36:25,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:36:25,793 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:36:25,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:36:25,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:36:25,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:36:25,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:36:25,795 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:36:25,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:36:25,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:36:25,796 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:36:25,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:36:25,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:36:25,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:36:25,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:36:25,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:36:25,799 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:36:25,799 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:36:25,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:36:25,800 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:36:25,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:36:25,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:36:25,800 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:36:25,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:36:25,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:36:25,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:36:25,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:36:25,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:36:25,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:36:25,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:36:25,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:36:25,802 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:36:25,805 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:36:25,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:36:25,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:36:25,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:36:25,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:36:25,806 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:36:25,806 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 -> 8d6e232da9a83d5f71424a24404b69fd0e4337eea9ca06f51ad2ecca1f048cf0 [2024-10-13 03:36:26,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:36:26,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:36:26,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:36:26,084 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:36:26,084 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:36:26,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i [2024-10-13 03:36:27,387 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:36:27,540 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:36:27,541 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i [2024-10-13 03:36:27,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4d8a4e35/a199786f095d48658a89e482bc9790dc/FLAGbbf3dfcc9 [2024-10-13 03:36:27,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4d8a4e35/a199786f095d48658a89e482bc9790dc [2024-10-13 03:36:27,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:36:27,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:36:27,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:36:27,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:36:27,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:36:27,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:36:27" (1/1) ... [2024-10-13 03:36:27,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136a0c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:27, skipping insertion in model container [2024-10-13 03:36:27,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:36:27" (1/1) ... [2024-10-13 03:36:27,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:36:28,117 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_floatingpointinfluence_no-floats_file-36.i[916,929] [2024-10-13 03:36:28,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:36:28,174 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:36:28,185 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_floatingpointinfluence_no-floats_file-36.i[916,929] [2024-10-13 03:36:28,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:36:28,225 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:36:28,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:28 WrapperNode [2024-10-13 03:36:28,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:36:28,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:36:28,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:36:28,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:36:28,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:28" (1/1) ... [2024-10-13 03:36:28,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:28" (1/1) ... [2024-10-13 03:36:28,264 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-10-13 03:36:28,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:36:28,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:36:28,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:36:28,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:36:28,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:28" (1/1) ... [2024-10-13 03:36:28,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:28" (1/1) ... [2024-10-13 03:36:28,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:28" (1/1) ... [2024-10-13 03:36:28,295 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-13 03:36:28,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:28" (1/1) ... [2024-10-13 03:36:28,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:28" (1/1) ... [2024-10-13 03:36:28,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:28" (1/1) ... [2024-10-13 03:36:28,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:28" (1/1) ... [2024-10-13 03:36:28,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:28" (1/1) ... [2024-10-13 03:36:28,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:28" (1/1) ... [2024-10-13 03:36:28,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:36:28,322 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:36:28,322 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:36:28,322 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:36:28,323 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:28" (1/1) ... [2024-10-13 03:36:28,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:36:28,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:36:28,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:36:28,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:36:28,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:36:28,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:36:28,406 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:36:28,406 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:36:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:36:28,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:36:28,468 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:36:28,469 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:36:28,650 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 03:36:28,650 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:36:28,696 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:36:28,699 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:36:28,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:36:28 BoogieIcfgContainer [2024-10-13 03:36:28,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:36:28,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:36:28,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:36:28,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:36:28,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:36:27" (1/3) ... [2024-10-13 03:36:28,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34967b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:36:28, skipping insertion in model container [2024-10-13 03:36:28,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:28" (2/3) ... [2024-10-13 03:36:28,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34967b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:36:28, skipping insertion in model container [2024-10-13 03:36:28,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:36:28" (3/3) ... [2024-10-13 03:36:28,710 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-36.i [2024-10-13 03:36:28,722 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:36:28,723 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:36:28,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:36:28,778 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;@5bbe403f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:36:28,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:36:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 03:36:28,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 03:36:28,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:36:28,792 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:36:28,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:36:28,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:36:28,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1784490051, now seen corresponding path program 1 times [2024-10-13 03:36:28,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:36:28,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976203404] [2024-10-13 03:36:28,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:36:28,814 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-13 03:36:28,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:36:28,817 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:36:28,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 03:36:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:28,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:36:28,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:36:29,002 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:36:29,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:36:29,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:36:29,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976203404] [2024-10-13 03:36:29,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976203404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:36:29,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:36:29,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:36:29,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068051723] [2024-10-13 03:36:29,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:36:29,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:36:29,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:36:29,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:36:29,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:36:29,027 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:36:29,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:36:29,058 INFO L93 Difference]: Finished difference Result 87 states and 154 transitions. [2024-10-13 03:36:29,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:36:29,061 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2024-10-13 03:36:29,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:36:29,068 INFO L225 Difference]: With dead ends: 87 [2024-10-13 03:36:29,068 INFO L226 Difference]: Without dead ends: 43 [2024-10-13 03:36:29,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:36:29,074 INFO L432 NwaCegarLoop]: 61 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, 61 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-13 03:36:29,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:36:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-13 03:36:29,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-13 03:36:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 03:36:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2024-10-13 03:36:29,104 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 98 [2024-10-13 03:36:29,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:36:29,105 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2024-10-13 03:36:29,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:36:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2024-10-13 03:36:29,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 03:36:29,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:36:29,108 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:36:29,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 03:36:29,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:36:29,309 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:36:29,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:36:29,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1414749695, now seen corresponding path program 1 times [2024-10-13 03:36:29,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:36:29,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989076992] [2024-10-13 03:36:29,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:36:29,311 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-13 03:36:29,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:36:29,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:36:29,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 03:36:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:36:29,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:36:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:36:29,430 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-10-13 03:36:29,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1605941160] [2024-10-13 03:36:29,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:36:29,431 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 03:36:29,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 03:36:29,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 03:36:29,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-13 03:36:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:29,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 03:36:29,608 INFO L278 TraceCheckSpWp]: Computing forward predicates...