./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_has-floats_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:44:23,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:44:23,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:44:23,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:44:23,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:44:23,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:44:23,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:44:23,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:44:23,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:44:23,358 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:44:23,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:44:23,360 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:44:23,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:44:23,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:44:23,361 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:44:23,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:44:23,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:44:23,365 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:44:23,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:44:23,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:44:23,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:44:23,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:44:23,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:44:23,367 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:44:23,367 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:44:23,367 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:44:23,367 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:44:23,367 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:44:23,368 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:44:23,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:44:23,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:44:23,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:44:23,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:44:23,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:44:23,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:44:23,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:44:23,370 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:44:23,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:44:23,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:44:23,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:44:23,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:44:23,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:44:23,373 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 [2024-10-11 10:44:23,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:44:23,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:44:23,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:44:23,641 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:44:23,642 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:44:23,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2024-10-11 10:44:25,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:44:25,308 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:44:25,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2024-10-11 10:44:25,318 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b5a05f383/c8458ecf801e4e2aaabbf5bcb8ace9b3/FLAG67ae2df41 [2024-10-11 10:44:25,333 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b5a05f383/c8458ecf801e4e2aaabbf5bcb8ace9b3 [2024-10-11 10:44:25,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:44:25,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:44:25,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:44:25,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:44:25,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:44:25,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:44:25" (1/1) ... [2024-10-11 10:44:25,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45121737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:25, skipping insertion in model container [2024-10-11 10:44:25,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:44:25" (1/1) ... [2024-10-11 10:44:25,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:44:25,533 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_has-floats_file-33.i[917,930] [2024-10-11 10:44:25,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:44:25,586 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:44:25,597 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_has-floats_file-33.i[917,930] [2024-10-11 10:44:25,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:44:25,636 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:44:25,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:25 WrapperNode [2024-10-11 10:44:25,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:44:25,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:44:25,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:44:25,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:44:25,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:25" (1/1) ... [2024-10-11 10:44:25,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:25" (1/1) ... [2024-10-11 10:44:25,703 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2024-10-11 10:44:25,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:44:25,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:44:25,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:44:25,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:44:25,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:25" (1/1) ... [2024-10-11 10:44:25,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:25" (1/1) ... [2024-10-11 10:44:25,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:25" (1/1) ... [2024-10-11 10:44:25,740 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:44:25,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:25" (1/1) ... [2024-10-11 10:44:25,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:25" (1/1) ... [2024-10-11 10:44:25,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:25" (1/1) ... [2024-10-11 10:44:25,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:25" (1/1) ... [2024-10-11 10:44:25,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:25" (1/1) ... [2024-10-11 10:44:25,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:25" (1/1) ... [2024-10-11 10:44:25,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:44:25,762 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:44:25,762 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:44:25,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:44:25,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:25" (1/1) ... [2024-10-11 10:44:25,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:44:25,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:44:25,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:44:25,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:44:25,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:44:25,862 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:44:25,863 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:44:25,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:44:25,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:44:25,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:44:25,959 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:44:25,962 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:44:26,307 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-11 10:44:26,307 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:44:26,377 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:44:26,379 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:44:26,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:44:26 BoogieIcfgContainer [2024-10-11 10:44:26,379 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:44:26,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:44:26,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:44:26,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:44:26,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:44:25" (1/3) ... [2024-10-11 10:44:26,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9ddee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:44:26, skipping insertion in model container [2024-10-11 10:44:26,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:25" (2/3) ... [2024-10-11 10:44:26,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9ddee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:44:26, skipping insertion in model container [2024-10-11 10:44:26,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:44:26" (3/3) ... [2024-10-11 10:44:26,388 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-33.i [2024-10-11 10:44:26,401 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:44:26,401 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:44:26,455 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:44:26,462 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;@6553ef41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:44:26,462 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:44:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 10:44:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 10:44:26,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:26,479 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:26,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:26,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:26,486 INFO L85 PathProgramCache]: Analyzing trace with hash 123147903, now seen corresponding path program 1 times [2024-10-11 10:44:26,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:26,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613597324] [2024-10-11 10:44:26,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:26,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:26,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:26,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:44:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:26,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:44:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:26,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:44:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:26,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:44:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:26,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:44:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:26,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:44:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:26,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:44:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:26,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:44:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 10:44:26,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:26,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613597324] [2024-10-11 10:44:26,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613597324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:26,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:26,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:44:26,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609090579] [2024-10-11 10:44:26,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:26,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:44:26,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:26,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:44:26,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:44:26,869 INFO L87 Difference]: Start difference. First operand has 60 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 10:44:26,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:26,914 INFO L93 Difference]: Finished difference Result 117 states and 189 transitions. [2024-10-11 10:44:26,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:44:26,918 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 70 [2024-10-11 10:44:26,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:26,926 INFO L225 Difference]: With dead ends: 117 [2024-10-11 10:44:26,926 INFO L226 Difference]: Without dead ends: 58 [2024-10-11 10:44:26,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:44:26,936 INFO L432 NwaCegarLoop]: 83 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, 83 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:26,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:44:26,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-11 10:44:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-11 10:44:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 states have internal predecessors, (68), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 10:44:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2024-10-11 10:44:26,987 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 70 [2024-10-11 10:44:26,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:26,987 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2024-10-11 10:44:26,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 10:44:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2024-10-11 10:44:26,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 10:44:26,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:26,991 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:26,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:44:26,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:26,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:26,992 INFO L85 PathProgramCache]: Analyzing trace with hash -60785799, now seen corresponding path program 1 times [2024-10-11 10:44:26,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:26,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856201268] [2024-10-11 10:44:26,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:26,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:44:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:44:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:44:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:44:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:44:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:44:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:44:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:44:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 10:44:27,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:27,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856201268] [2024-10-11 10:44:27,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856201268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:27,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:27,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:44:27,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595668782] [2024-10-11 10:44:27,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:27,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:44:27,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:27,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:44:27,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:44:27,255 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:27,287 INFO L93 Difference]: Finished difference Result 116 states and 173 transitions. [2024-10-11 10:44:27,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:44:27,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2024-10-11 10:44:27,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:27,290 INFO L225 Difference]: With dead ends: 116 [2024-10-11 10:44:27,290 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 10:44:27,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:44:27,294 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:27,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:44:27,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 10:44:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-11 10:44:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 10:44:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-10-11 10:44:27,305 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 70 [2024-10-11 10:44:27,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:27,307 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-10-11 10:44:27,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:27,307 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-10-11 10:44:27,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 10:44:27,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:27,310 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:27,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:44:27,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:27,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:27,312 INFO L85 PathProgramCache]: Analyzing trace with hash -870132425, now seen corresponding path program 1 times [2024-10-11 10:44:27,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:27,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436974760] [2024-10-11 10:44:27,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:27,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:44:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:44:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:44:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:44:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:44:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:44:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:44:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:44:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 10:44:27,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:27,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436974760] [2024-10-11 10:44:27,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436974760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:27,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:27,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:44:27,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542001757] [2024-10-11 10:44:27,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:27,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:44:27,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:27,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:44:27,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:44:27,576 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:27,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:27,815 INFO L93 Difference]: Finished difference Result 141 states and 207 transitions. [2024-10-11 10:44:27,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:44:27,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2024-10-11 10:44:27,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:27,817 INFO L225 Difference]: With dead ends: 141 [2024-10-11 10:44:27,817 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 10:44:27,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:44:27,819 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 83 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:27,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 248 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:44:27,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 10:44:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2024-10-11 10:44:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 10:44:27,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2024-10-11 10:44:27,828 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 70 [2024-10-11 10:44:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:27,829 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2024-10-11 10:44:27,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:27,829 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2024-10-11 10:44:27,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 10:44:27,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:27,831 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:27,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:44:27,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:27,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:27,832 INFO L85 PathProgramCache]: Analyzing trace with hash -169067847, now seen corresponding path program 1 times [2024-10-11 10:44:27,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:27,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67303466] [2024-10-11 10:44:27,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:27,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:29,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:29,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:44:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:29,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:44:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:29,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:44:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:29,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:44:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:44:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:29,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:44:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:29,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:44:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:29,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:44:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 10:44:29,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:29,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67303466] [2024-10-11 10:44:29,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67303466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:29,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:29,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 10:44:29,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947240701] [2024-10-11 10:44:29,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:29,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:44:29,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:29,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:44:29,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:44:29,830 INFO L87 Difference]: Start difference. First operand 61 states and 89 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:30,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:30,675 INFO L93 Difference]: Finished difference Result 243 states and 354 transitions. [2024-10-11 10:44:30,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:44:30,676 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2024-10-11 10:44:30,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:30,678 INFO L225 Difference]: With dead ends: 243 [2024-10-11 10:44:30,678 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 10:44:30,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-10-11 10:44:30,680 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 226 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:30,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 350 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 10:44:30,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 10:44:30,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 79. [2024-10-11 10:44:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 10:44:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2024-10-11 10:44:30,698 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 70 [2024-10-11 10:44:30,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:30,698 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2024-10-11 10:44:30,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2024-10-11 10:44:30,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 10:44:30,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:30,704 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:30,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:44:30,704 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:30,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:30,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1757415749, now seen corresponding path program 1 times [2024-10-11 10:44:30,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:30,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702155721] [2024-10-11 10:44:30,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:30,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:44:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:44:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:44:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:44:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:44:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:44:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:44:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:44:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 10:44:31,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:31,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702155721] [2024-10-11 10:44:31,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702155721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:31,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:31,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 10:44:31,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445371327] [2024-10-11 10:44:31,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:31,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 10:44:31,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:31,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 10:44:31,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:44:31,116 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:31,379 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2024-10-11 10:44:31,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 10:44:31,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2024-10-11 10:44:31,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:31,381 INFO L225 Difference]: With dead ends: 226 [2024-10-11 10:44:31,381 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 10:44:31,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:44:31,382 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 208 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:31,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 325 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:44:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 10:44:31,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 87. [2024-10-11 10:44:31,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 76 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 10:44:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 128 transitions. [2024-10-11 10:44:31,390 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 128 transitions. Word has length 70 [2024-10-11 10:44:31,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:31,391 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 128 transitions. [2024-10-11 10:44:31,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 128 transitions. [2024-10-11 10:44:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 10:44:31,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:31,393 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:31,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:44:31,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:31,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:31,394 INFO L85 PathProgramCache]: Analyzing trace with hash 513339644, now seen corresponding path program 1 times [2024-10-11 10:44:31,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:31,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906302948] [2024-10-11 10:44:31,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:31,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:44:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:44:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:44:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:44:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:44:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:44:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:44:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:44:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 10:44:31,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:31,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906302948] [2024-10-11 10:44:31,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906302948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:31,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:31,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:44:31,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478293920] [2024-10-11 10:44:31,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:31,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:44:31,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:31,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:44:31,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:44:31,451 INFO L87 Difference]: Start difference. First operand 87 states and 128 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:31,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:31,504 INFO L93 Difference]: Finished difference Result 226 states and 333 transitions. [2024-10-11 10:44:31,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:44:31,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2024-10-11 10:44:31,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:31,506 INFO L225 Difference]: With dead ends: 226 [2024-10-11 10:44:31,506 INFO L226 Difference]: Without dead ends: 140 [2024-10-11 10:44:31,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:44:31,508 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 52 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:31,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 172 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:44:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-11 10:44:31,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2024-10-11 10:44:31,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 96 states have internal predecessors, (137), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 10:44:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2024-10-11 10:44:31,522 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 71 [2024-10-11 10:44:31,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:31,522 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2024-10-11 10:44:31,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:31,523 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2024-10-11 10:44:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 10:44:31,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:31,524 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:31,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 10:44:31,525 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:31,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2104015663, now seen corresponding path program 1 times [2024-10-11 10:44:31,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:31,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298852374] [2024-10-11 10:44:31,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:31,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:44:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:44:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:44:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:44:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:44:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:44:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:44:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:44:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 10:44:31,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:31,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298852374] [2024-10-11 10:44:31,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298852374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:31,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:31,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:44:31,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478855314] [2024-10-11 10:44:31,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:31,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:44:31,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:31,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:44:31,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:44:31,601 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:31,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:31,647 INFO L93 Difference]: Finished difference Result 246 states and 355 transitions. [2024-10-11 10:44:31,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:44:31,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2024-10-11 10:44:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:31,651 INFO L225 Difference]: With dead ends: 246 [2024-10-11 10:44:31,651 INFO L226 Difference]: Without dead ends: 140 [2024-10-11 10:44:31,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:44:31,652 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 71 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:31,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 142 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:44:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-11 10:44:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 90. [2024-10-11 10:44:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 10:44:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2024-10-11 10:44:31,670 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 71 [2024-10-11 10:44:31,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:31,671 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2024-10-11 10:44:31,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2024-10-11 10:44:31,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 10:44:31,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:31,672 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:31,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 10:44:31,672 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:31,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:31,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1531250867, now seen corresponding path program 1 times [2024-10-11 10:44:31,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:31,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849597667] [2024-10-11 10:44:31,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:31,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:44:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:44:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:44:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:44:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:44:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:44:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:44:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:44:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 10:44:32,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:32,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849597667] [2024-10-11 10:44:32,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849597667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:32,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:32,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 10:44:32,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35507588] [2024-10-11 10:44:32,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:32,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:44:32,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:32,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:44:32,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:44:32,481 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:33,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:33,222 INFO L93 Difference]: Finished difference Result 334 states and 472 transitions. [2024-10-11 10:44:33,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:44:33,224 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2024-10-11 10:44:33,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:33,226 INFO L225 Difference]: With dead ends: 334 [2024-10-11 10:44:33,226 INFO L226 Difference]: Without dead ends: 245 [2024-10-11 10:44:33,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-10-11 10:44:33,227 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 249 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:33,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 410 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 10:44:33,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-11 10:44:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 74. [2024-10-11 10:44:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 10:44:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2024-10-11 10:44:33,237 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 71 [2024-10-11 10:44:33,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:33,238 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2024-10-11 10:44:33,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2024-10-11 10:44:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 10:44:33,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:33,239 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:33,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 10:44:33,240 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:33,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:33,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2035515578, now seen corresponding path program 1 times [2024-10-11 10:44:33,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:33,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14336151] [2024-10-11 10:44:33,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:33,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:44:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:44:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:44:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:44:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:44:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:44:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:44:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:44:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,341 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 10:44:33,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:33,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14336151] [2024-10-11 10:44:33,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14336151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:33,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:33,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 10:44:33,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350255182] [2024-10-11 10:44:33,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:33,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 10:44:33,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:33,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 10:44:33,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 10:44:33,344 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:33,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:33,585 INFO L93 Difference]: Finished difference Result 232 states and 324 transitions. [2024-10-11 10:44:33,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 10:44:33,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2024-10-11 10:44:33,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:33,587 INFO L225 Difference]: With dead ends: 232 [2024-10-11 10:44:33,587 INFO L226 Difference]: Without dead ends: 159 [2024-10-11 10:44:33,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:44:33,588 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 195 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:33,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 285 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:44:33,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-11 10:44:33,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2024-10-11 10:44:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 128 states have (on average 1.3515625) internal successors, (173), 130 states have internal predecessors, (173), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:44:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 213 transitions. [2024-10-11 10:44:33,609 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 213 transitions. Word has length 72 [2024-10-11 10:44:33,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:33,613 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 213 transitions. [2024-10-11 10:44:33,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:33,613 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 213 transitions. [2024-10-11 10:44:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 10:44:33,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:33,614 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:33,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 10:44:33,615 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:33,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:33,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1777350140, now seen corresponding path program 1 times [2024-10-11 10:44:33,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:33,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44944875] [2024-10-11 10:44:33,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:33,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:34,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:34,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:44:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:34,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:44:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:34,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:44:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:34,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:44:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:34,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:44:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:34,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:44:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:34,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:44:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:34,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:44:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:34,689 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 10:44:34,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:34,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44944875] [2024-10-11 10:44:34,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44944875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:34,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:34,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 10:44:34,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096006341] [2024-10-11 10:44:34,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:34,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:44:34,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:34,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:44:34,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:44:34,692 INFO L87 Difference]: Start difference. First operand 153 states and 213 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:35,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:35,368 INFO L93 Difference]: Finished difference Result 452 states and 630 transitions. [2024-10-11 10:44:35,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:44:35,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2024-10-11 10:44:35,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:35,371 INFO L225 Difference]: With dead ends: 452 [2024-10-11 10:44:35,371 INFO L226 Difference]: Without dead ends: 303 [2024-10-11 10:44:35,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-11 10:44:35,373 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 369 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:35,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 177 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 10:44:35,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-11 10:44:35,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 173. [2024-10-11 10:44:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 148 states have (on average 1.364864864864865) internal successors, (202), 150 states have internal predecessors, (202), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:44:35,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 242 transitions. [2024-10-11 10:44:35,390 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 242 transitions. Word has length 72 [2024-10-11 10:44:35,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:35,391 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 242 transitions. [2024-10-11 10:44:35,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:35,391 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 242 transitions. [2024-10-11 10:44:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 10:44:35,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:35,392 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:35,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 10:44:35,394 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:35,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:35,394 INFO L85 PathProgramCache]: Analyzing trace with hash 828673414, now seen corresponding path program 1 times [2024-10-11 10:44:35,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:35,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442001247] [2024-10-11 10:44:35,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:35,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:44:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:44:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:44:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:44:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:44:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:44:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:44:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:44:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,520 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 10:44:35,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:35,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442001247] [2024-10-11 10:44:35,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442001247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:35,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:35,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:44:35,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090699591] [2024-10-11 10:44:35,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:35,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:44:35,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:35,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:44:35,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:44:35,523 INFO L87 Difference]: Start difference. First operand 173 states and 242 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:35,612 INFO L93 Difference]: Finished difference Result 489 states and 683 transitions. [2024-10-11 10:44:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:44:35,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2024-10-11 10:44:35,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:35,616 INFO L225 Difference]: With dead ends: 489 [2024-10-11 10:44:35,616 INFO L226 Difference]: Without dead ends: 320 [2024-10-11 10:44:35,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:44:35,619 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 60 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:35,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 163 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:44:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-11 10:44:35,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 251. [2024-10-11 10:44:35,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 215 states have (on average 1.3488372093023255) internal successors, (290), 217 states have internal predecessors, (290), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 10:44:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 348 transitions. [2024-10-11 10:44:35,648 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 348 transitions. Word has length 72 [2024-10-11 10:44:35,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:35,648 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 348 transitions. [2024-10-11 10:44:35,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:35,648 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 348 transitions. [2024-10-11 10:44:35,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 10:44:35,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:35,650 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:35,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 10:44:35,650 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:35,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:35,651 INFO L85 PathProgramCache]: Analyzing trace with hash 881496481, now seen corresponding path program 1 times [2024-10-11 10:44:35,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:35,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875958053] [2024-10-11 10:44:35,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:35,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:44:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:44:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:44:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:44:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:44:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:44:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:44:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:44:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-11 10:44:35,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:35,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875958053] [2024-10-11 10:44:35,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875958053] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:44:35,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226502563] [2024-10-11 10:44:35,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:35,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:44:35,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:44:35,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:44:35,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:44:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:35,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 10:44:35,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:44:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 10:44:36,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:44:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-11 10:44:36,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226502563] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:44:36,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 10:44:36,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2024-10-11 10:44:36,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380271645] [2024-10-11 10:44:36,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 10:44:36,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 10:44:36,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:36,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 10:44:36,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-10-11 10:44:36,307 INFO L87 Difference]: Start difference. First operand 251 states and 348 transitions. Second operand has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2024-10-11 10:44:36,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:36,865 INFO L93 Difference]: Finished difference Result 839 states and 1130 transitions. [2024-10-11 10:44:36,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 10:44:36,866 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) Word has length 73 [2024-10-11 10:44:36,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:36,870 INFO L225 Difference]: With dead ends: 839 [2024-10-11 10:44:36,870 INFO L226 Difference]: Without dead ends: 737 [2024-10-11 10:44:36,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=313, Invalid=877, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 10:44:36,872 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 1086 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:36,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 556 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:44:36,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-11 10:44:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 267. [2024-10-11 10:44:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 209 states have (on average 1.277511961722488) internal successors, (267), 210 states have internal predecessors, (267), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 10:44:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 357 transitions. [2024-10-11 10:44:36,903 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 357 transitions. Word has length 73 [2024-10-11 10:44:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:36,903 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 357 transitions. [2024-10-11 10:44:36,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2024-10-11 10:44:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 357 transitions. [2024-10-11 10:44:36,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 10:44:36,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:36,904 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:36,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 10:44:37,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 10:44:37,109 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:37,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:37,109 INFO L85 PathProgramCache]: Analyzing trace with hash 63848031, now seen corresponding path program 1 times [2024-10-11 10:44:37,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:37,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600824315] [2024-10-11 10:44:37,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:37,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:44:37,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:44:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:44:37,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:44:37,184 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:44:37,185 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:44:37,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 10:44:37,190 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:37,250 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:44:37,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:44:37 BoogieIcfgContainer [2024-10-11 10:44:37,255 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:44:37,256 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:44:37,256 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:44:37,256 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:44:37,257 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:44:26" (3/4) ... [2024-10-11 10:44:37,259 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:44:37,260 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:44:37,260 INFO L158 Benchmark]: Toolchain (without parser) took 11922.46ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 98.5MB in the beginning and 151.6MB in the end (delta: -53.2MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2024-10-11 10:44:37,261 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:44:37,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.73ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 84.4MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 10:44:37,261 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.54ms. Allocated memory is still 167.8MB. Free memory was 84.4MB in the beginning and 81.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:44:37,261 INFO L158 Benchmark]: Boogie Preprocessor took 56.32ms. Allocated memory is still 167.8MB. Free memory was 81.0MB in the beginning and 77.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:44:37,262 INFO L158 Benchmark]: RCFGBuilder took 617.94ms. Allocated memory is still 167.8MB. Free memory was 77.6MB in the beginning and 128.3MB in the end (delta: -50.7MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-10-11 10:44:37,262 INFO L158 Benchmark]: TraceAbstraction took 10873.45ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 128.3MB in the beginning and 151.6MB in the end (delta: -23.4MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. [2024-10-11 10:44:37,262 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 251.7MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:44:37,263 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.15ms. Allocated memory is still 113.2MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.73ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 84.4MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.54ms. Allocated memory is still 167.8MB. Free memory was 84.4MB in the beginning and 81.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.32ms. Allocated memory is still 167.8MB. Free memory was 81.0MB in the beginning and 77.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 617.94ms. Allocated memory is still 167.8MB. Free memory was 77.6MB in the beginning and 128.3MB in the end (delta: -50.7MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10873.45ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 128.3MB in the beginning and 151.6MB in the end (delta: -23.4MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 251.7MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] signed short int var_1_5 = 4; [L24] unsigned char var_1_7 = 200; [L25] unsigned char var_1_8 = 32; [L26] float var_1_9 = 256.5; [L27] float var_1_10 = -0.25; [L28] float var_1_11 = 0.30000000000000004; [L29] float var_1_12 = 49.5; [L30] signed long int var_1_13 = -8; [L31] unsigned char var_1_14 = 0; [L32] float var_1_15 = 0.4; [L33] signed long int var_1_16 = -256; [L34] signed long int last_1_var_1_13 = -8; [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] CALL updateLastVariables() [L81] last_1_var_1_13 = var_1_13 [L91] RET updateLastVariables() [L92] CALL updateVariables() [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L65] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L67] var_1_8 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_9=513/2] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_9=513/2] [L69] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L69] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L70] var_1_10 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L71] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L72] var_1_11 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L73] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L74] var_1_12 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L75] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L76] var_1_14 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L77] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L92] RET updateVariables() [L93] CALL step() [L38] COND FALSE !(var_1_5 < last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L41] var_1_16 = var_1_7 [L42] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L43] COND TRUE ! var_1_14 [L44] var_1_13 = var_1_8 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=0, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L52] var_1_15 = var_1_11 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] signed long int stepLocal_0 = (var_1_13 ^ var_1_7) + var_1_16; [L54] COND FALSE !(stepLocal_0 < -1) [L57] var_1_1 = (128 - (var_1_7 + var_1_7)) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] COND FALSE !(var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) [L93] RET step() [L94] CALL, EXPR property() [L84] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84-L85] return ((((((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1)) && ((! var_1_14) ? (var_1_13 == ((signed long int) var_1_8)) : ((var_1_7 > (var_1_7 + var_1_7)) ? (var_1_13 == ((signed long int) var_1_7)) : (var_1_13 == ((signed long int) var_1_16))))) && (var_1_15 == ((float) var_1_11))) && (var_1_16 == ((signed long int) var_1_7)) ; [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 13, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2607 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2599 mSDsluCounter, 3069 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2081 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2248 IncrementalHoareTripleChecker+Invalid, 2398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 988 mSDtfsCounter, 2248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 486 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=267occurred in iteration=12, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 1116 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 998 NumberOfCodeBlocks, 998 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 984 ConstructedInterpolants, 0 QuantifiedInterpolants, 7184 SizeOfPredicates, 4 NumberOfNonLiveVariables, 188 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 1944/2016 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 10:44:37,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:44:39,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:44:39,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:44:39,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:44:39,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:44:39,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:44:39,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:44:39,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:44:39,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:44:39,631 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:44:39,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:44:39,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:44:39,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:44:39,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:44:39,637 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:44:39,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:44:39,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:44:39,638 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:44:39,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:44:39,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:44:39,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:44:39,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:44:39,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:44:39,641 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:44:39,642 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:44:39,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:44:39,643 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:44:39,643 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:44:39,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:44:39,644 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:44:39,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:44:39,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:44:39,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:44:39,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:44:39,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:44:39,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:44:39,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:44:39,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:44:39,647 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:44:39,648 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:44:39,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:44:39,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:44:39,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:44:39,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:44:39,649 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:44:39,649 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 [2024-10-11 10:44:39,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:44:40,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:44:40,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:44:40,017 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:44:40,018 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:44:40,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2024-10-11 10:44:41,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:44:41,824 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:44:41,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2024-10-11 10:44:41,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6bb2e0e42/edf15a4227d141669ed25dbd7735952c/FLAG84fc0d14a [2024-10-11 10:44:41,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6bb2e0e42/edf15a4227d141669ed25dbd7735952c [2024-10-11 10:44:41,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:44:41,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:44:41,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:44:41,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:44:41,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:44:41,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:44:41" (1/1) ... [2024-10-11 10:44:41,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af6c135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:41, skipping insertion in model container [2024-10-11 10:44:41,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:44:41" (1/1) ... [2024-10-11 10:44:41,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:44:42,082 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_has-floats_file-33.i[917,930] [2024-10-11 10:44:42,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:44:42,154 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:44:42,168 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_has-floats_file-33.i[917,930] [2024-10-11 10:44:42,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:44:42,208 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:44:42,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:42 WrapperNode [2024-10-11 10:44:42,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:44:42,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:44:42,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:44:42,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:44:42,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:42" (1/1) ... [2024-10-11 10:44:42,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:42" (1/1) ... [2024-10-11 10:44:42,247 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-10-11 10:44:42,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:44:42,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:44:42,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:44:42,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:44:42,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:42" (1/1) ... [2024-10-11 10:44:42,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:42" (1/1) ... [2024-10-11 10:44:42,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:42" (1/1) ... [2024-10-11 10:44:42,272 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:44:42,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:42" (1/1) ... [2024-10-11 10:44:42,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:42" (1/1) ... [2024-10-11 10:44:42,282 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:42" (1/1) ... [2024-10-11 10:44:42,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:42" (1/1) ... [2024-10-11 10:44:42,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:42" (1/1) ... [2024-10-11 10:44:42,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:42" (1/1) ... [2024-10-11 10:44:42,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:44:42,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:44:42,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:44:42,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:44:42,307 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:42" (1/1) ... [2024-10-11 10:44:42,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:44:42,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:44:42,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:44:42,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:44:42,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:44:42,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:44:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:44:42,391 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:44:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:44:42,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:44:42,480 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:44:42,482 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:44:43,195 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:44:43,195 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:44:43,272 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:44:43,272 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:44:43,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:44:43 BoogieIcfgContainer [2024-10-11 10:44:43,272 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:44:43,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:44:43,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:44:43,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:44:43,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:44:41" (1/3) ... [2024-10-11 10:44:43,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460fd128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:44:43, skipping insertion in model container [2024-10-11 10:44:43,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:42" (2/3) ... [2024-10-11 10:44:43,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460fd128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:44:43, skipping insertion in model container [2024-10-11 10:44:43,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:44:43" (3/3) ... [2024-10-11 10:44:43,282 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-33.i [2024-10-11 10:44:43,297 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:44:43,298 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:44:43,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:44:43,380 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;@77fed52e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:44:43,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:44:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 10:44:43,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 10:44:43,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:43,397 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:43,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:43,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:43,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1056546956, now seen corresponding path program 1 times [2024-10-11 10:44:43,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:44:43,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158348919] [2024-10-11 10:44:43,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:43,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:44:43,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:44:43,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:44:43,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 10:44:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:43,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:44:43,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:44:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-11 10:44:43,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:44:43,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:44:43,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158348919] [2024-10-11 10:44:43,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158348919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:43,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:43,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:44:43,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92029493] [2024-10-11 10:44:43,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:43,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:44:43,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:44:43,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:44:43,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:44:43,706 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 10:44:43,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:43,963 INFO L93 Difference]: Finished difference Result 67 states and 109 transitions. [2024-10-11 10:44:43,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:44:43,973 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2024-10-11 10:44:43,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:43,984 INFO L225 Difference]: With dead ends: 67 [2024-10-11 10:44:43,985 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 10:44:43,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:44:43,991 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:43,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:44:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 10:44:44,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 10:44:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 10:44:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2024-10-11 10:44:44,024 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 62 [2024-10-11 10:44:44,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:44,025 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2024-10-11 10:44:44,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 10:44:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2024-10-11 10:44:44,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 10:44:44,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:44,027 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:44,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 10:44:44,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:44:44,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:44,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:44,229 INFO L85 PathProgramCache]: Analyzing trace with hash 924409454, now seen corresponding path program 1 times [2024-10-11 10:44:44,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:44:44,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977535319] [2024-10-11 10:44:44,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:44,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:44:44,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:44:44,232 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:44:44,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 10:44:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:44,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:44:44,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:44:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 10:44:45,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:44:45,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:44:45,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977535319] [2024-10-11 10:44:45,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977535319] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:44:45,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2055640929] [2024-10-11 10:44:45,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:45,247 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 10:44:45,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 10:44:45,260 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 10:44:45,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-11 10:44:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:45,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 10:44:45,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:44:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 10:44:45,733 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:44:45,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2055640929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:45,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 10:44:45,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-10-11 10:44:45,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835930898] [2024-10-11 10:44:45,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:45,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:44:45,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:44:45,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:44:45,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 10:44:45,738 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:46,291 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2024-10-11 10:44:46,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:44:46,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 62 [2024-10-11 10:44:46,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:46,294 INFO L225 Difference]: With dead ends: 89 [2024-10-11 10:44:46,295 INFO L226 Difference]: Without dead ends: 57 [2024-10-11 10:44:46,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-11 10:44:46,296 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 39 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:46,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 189 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 10:44:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-11 10:44:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 33. [2024-10-11 10:44:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 10:44:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-10-11 10:44:46,305 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 62 [2024-10-11 10:44:46,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:46,307 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-10-11 10:44:46,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 10:44:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-10-11 10:44:46,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 10:44:46,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:46,309 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:46,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 10:44:46,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-11 10:44:46,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 10:44:46,710 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:46,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:46,711 INFO L85 PathProgramCache]: Analyzing trace with hash 926316078, now seen corresponding path program 1 times [2024-10-11 10:44:46,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:44:46,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46502174] [2024-10-11 10:44:46,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:46,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:44:46,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:44:46,715 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:44:46,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 10:44:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:46,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:44:46,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:44:47,254 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 10:44:47,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:44:47,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:44:47,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46502174] [2024-10-11 10:44:47,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46502174] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:44:47,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2098511242] [2024-10-11 10:44:47,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:47,377 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 10:44:47,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 10:44:47,379 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 10:44:47,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-11 10:44:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:47,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 10:44:47,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:44:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 10:44:48,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:44:48,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2098511242] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:44:48,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:44:48,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-10-11 10:44:48,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297265891] [2024-10-11 10:44:48,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:44:48,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 10:44:48,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:44:48,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 10:44:48,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:44:48,183 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 10:44:48,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:48,839 INFO L93 Difference]: Finished difference Result 104 states and 136 transitions. [2024-10-11 10:44:48,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 10:44:48,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2024-10-11 10:44:48,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:48,847 INFO L225 Difference]: With dead ends: 104 [2024-10-11 10:44:48,847 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 10:44:48,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-11 10:44:48,849 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 42 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:48,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 149 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 10:44:48,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 10:44:48,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2024-10-11 10:44:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:44:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2024-10-11 10:44:48,865 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 62 [2024-10-11 10:44:48,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:48,865 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2024-10-11 10:44:48,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 10:44:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2024-10-11 10:44:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 10:44:48,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:48,867 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:48,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-10-11 10:44:49,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 10:44:49,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:44:49,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:49,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:49,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1606374448, now seen corresponding path program 1 times [2024-10-11 10:44:49,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:44:49,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25937434] [2024-10-11 10:44:49,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:49,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:44:49,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:44:49,283 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:44:49,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 10:44:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:49,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 10:44:49,502 INFO L278 TraceCheckSpWp]: Computing forward predicates...