./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.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_no-floats_file-38.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 ca7b092571e2aaa668ed3cc711eaa0aa2bd05b3934760ddf140f8cffb6c5d917 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:55:27,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:55:27,766 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:55:27,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:55:27,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:55:27,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:55:27,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:55:27,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:55:27,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:55:27,808 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:55:27,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:55:27,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:55:27,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:55:27,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:55:27,811 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:55:27,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:55:27,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:55:27,812 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:55:27,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:55:27,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:55:27,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:55:27,814 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:55:27,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:55:27,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:55:27,815 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:55:27,815 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:55:27,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:55:27,816 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:55:27,816 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:55:27,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:55:27,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:55:27,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:55:27,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:55:27,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:55:27,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:55:27,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:55:27,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:55:27,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:55:27,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:55:27,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:55:27,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:55:27,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:55:27,820 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-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 -> ca7b092571e2aaa668ed3cc711eaa0aa2bd05b3934760ddf140f8cffb6c5d917 [2024-10-11 10:55:28,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:55:28,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:55:28,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:55:28,067 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:55:28,068 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:55:28,069 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i [2024-10-11 10:55:29,407 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:55:29,627 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:55:29,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i [2024-10-11 10:55:29,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b31a22db6/9a7394a4cf22483db3adddea65a09e50/FLAG447101d19 [2024-10-11 10:55:30,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b31a22db6/9a7394a4cf22483db3adddea65a09e50 [2024-10-11 10:55:30,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:55:30,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:55:30,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:55:30,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:55:30,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:55:30,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:55:30" (1/1) ... [2024-10-11 10:55:30,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31fa5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:30, skipping insertion in model container [2024-10-11 10:55:30,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:55:30" (1/1) ... [2024-10-11 10:55:30,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:55:30,224 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i[916,929] [2024-10-11 10:55:30,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:55:30,339 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:55:30,349 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i[916,929] [2024-10-11 10:55:30,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:55:30,384 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:55:30,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:30 WrapperNode [2024-10-11 10:55:30,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:55:30,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:55:30,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:55:30,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:55:30,391 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:55:30" (1/1) ... [2024-10-11 10:55:30,398 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:55:30" (1/1) ... [2024-10-11 10:55:30,430 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-10-11 10:55:30,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:55:30,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:55:30,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:55:30,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:55:30,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:30" (1/1) ... [2024-10-11 10:55:30,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:30" (1/1) ... [2024-10-11 10:55:30,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:30" (1/1) ... [2024-10-11 10:55:30,469 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:55:30,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:30" (1/1) ... [2024-10-11 10:55:30,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:30" (1/1) ... [2024-10-11 10:55:30,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:30" (1/1) ... [2024-10-11 10:55:30,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:30" (1/1) ... [2024-10-11 10:55:30,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:30" (1/1) ... [2024-10-11 10:55:30,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:30" (1/1) ... [2024-10-11 10:55:30,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:55:30,487 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:55:30,487 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:55:30,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:55:30,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:30" (1/1) ... [2024-10-11 10:55:30,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:55:30,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:55:30,530 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:55:30,533 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:55:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:55:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:55:30,577 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:55:30,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:55:30,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:55:30,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:55:30,660 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:55:30,664 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:55:30,935 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:55:30,936 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:55:31,004 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:55:31,005 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:55:31,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:55:31 BoogieIcfgContainer [2024-10-11 10:55:31,005 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:55:31,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:55:31,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:55:31,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:55:31,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:55:30" (1/3) ... [2024-10-11 10:55:31,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148aace7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:55:31, skipping insertion in model container [2024-10-11 10:55:31,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:30" (2/3) ... [2024-10-11 10:55:31,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148aace7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:55:31, skipping insertion in model container [2024-10-11 10:55:31,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:55:31" (3/3) ... [2024-10-11 10:55:31,014 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-38.i [2024-10-11 10:55:31,031 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:55:31,031 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:55:31,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:55:31,087 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;@605dddd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:55:31,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:55:31,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 10:55:31,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 10:55:31,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:31,109 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:31,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:31,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:31,116 INFO L85 PathProgramCache]: Analyzing trace with hash 596099555, now seen corresponding path program 1 times [2024-10-11 10:55:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:31,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831460251] [2024-10-11 10:55:31,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:31,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:55:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:55:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 10:55:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:55:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 10:55:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 10:55:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 10:55:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 10:55:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 10:55:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 10:55:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 10:55:31,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:31,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831460251] [2024-10-11 10:55:31,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831460251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:31,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:31,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:55:31,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64671777] [2024-10-11 10:55:31,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:31,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:55:31,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:31,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:55:31,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:55:31,693 INFO L87 Difference]: Start difference. First operand has 61 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 10:55:31,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:31,748 INFO L93 Difference]: Finished difference Result 119 states and 216 transitions. [2024-10-11 10:55:31,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:55:31,752 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 164 [2024-10-11 10:55:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:31,761 INFO L225 Difference]: With dead ends: 119 [2024-10-11 10:55:31,762 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 10:55:31,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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:55:31,772 INFO L432 NwaCegarLoop]: 87 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, 87 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:55:31,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:55:31,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 10:55:31,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-11 10:55:31,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 10:55:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2024-10-11 10:55:31,848 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 164 [2024-10-11 10:55:31,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:31,848 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2024-10-11 10:55:31,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 10:55:31,849 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2024-10-11 10:55:31,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 10:55:31,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:31,855 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:31,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:55:31,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:31,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:31,857 INFO L85 PathProgramCache]: Analyzing trace with hash 743422435, now seen corresponding path program 1 times [2024-10-11 10:55:31,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:31,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042632005] [2024-10-11 10:55:31,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:31,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:55:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:55:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 10:55:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:55:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 10:55:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 10:55:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 10:55:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 10:55:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 10:55:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 10:55:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 10:55:32,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:32,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042632005] [2024-10-11 10:55:32,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042632005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:32,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:32,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:55:32,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170718760] [2024-10-11 10:55:32,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:32,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:55:32,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:32,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:55:32,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:55:32,176 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:55:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:32,254 INFO L93 Difference]: Finished difference Result 153 states and 231 transitions. [2024-10-11 10:55:32,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:55:32,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 164 [2024-10-11 10:55:32,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:32,258 INFO L225 Difference]: With dead ends: 153 [2024-10-11 10:55:32,260 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 10:55:32,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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:55:32,264 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 49 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:32,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 165 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:55:32,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 10:55:32,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-10-11 10:55:32,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 10:55:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 139 transitions. [2024-10-11 10:55:32,295 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 139 transitions. Word has length 164 [2024-10-11 10:55:32,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:32,297 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 139 transitions. [2024-10-11 10:55:32,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:55:32,298 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 139 transitions. [2024-10-11 10:55:32,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 10:55:32,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:32,302 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:32,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:55:32,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:32,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash 743482017, now seen corresponding path program 1 times [2024-10-11 10:55:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:32,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255896235] [2024-10-11 10:55:32,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:32,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:55:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:55:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 10:55:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:55:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 10:55:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 10:55:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 10:55:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 10:55:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 10:55:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 10:55:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 10:55:36,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:36,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255896235] [2024-10-11 10:55:36,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255896235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:36,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:36,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 10:55:36,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853484551] [2024-10-11 10:55:36,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:36,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 10:55:36,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:36,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 10:55:36,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:55:36,505 INFO L87 Difference]: Start difference. First operand 92 states and 139 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:55:36,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:36,820 INFO L93 Difference]: Finished difference Result 118 states and 169 transitions. [2024-10-11 10:55:36,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 10:55:36,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 164 [2024-10-11 10:55:36,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:36,825 INFO L225 Difference]: With dead ends: 118 [2024-10-11 10:55:36,825 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 10:55:36,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:55:36,827 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 31 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:36,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 364 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:55:36,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 10:55:36,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2024-10-11 10:55:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 52 states have internal predecessors, (58), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 10:55:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 146 transitions. [2024-10-11 10:55:36,845 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 146 transitions. Word has length 164 [2024-10-11 10:55:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:36,846 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 146 transitions. [2024-10-11 10:55:36,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:55:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 146 transitions. [2024-10-11 10:55:36,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 10:55:36,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:36,849 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:36,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:55:36,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:36,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:36,850 INFO L85 PathProgramCache]: Analyzing trace with hash -65864609, now seen corresponding path program 1 times [2024-10-11 10:55:36,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:36,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297352680] [2024-10-11 10:55:36,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:36,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:55:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:55:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 10:55:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:55:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 10:55:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 10:55:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 10:55:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 10:55:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 10:55:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 10:55:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 10:55:39,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:39,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297352680] [2024-10-11 10:55:39,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297352680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:39,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:39,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 10:55:39,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814815793] [2024-10-11 10:55:39,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:39,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 10:55:39,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:39,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 10:55:39,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:55:39,531 INFO L87 Difference]: Start difference. First operand 98 states and 146 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:55:39,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:39,813 INFO L93 Difference]: Finished difference Result 121 states and 172 transitions. [2024-10-11 10:55:39,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 10:55:39,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 164 [2024-10-11 10:55:39,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:39,816 INFO L225 Difference]: With dead ends: 121 [2024-10-11 10:55:39,816 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 10:55:39,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:55:39,821 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 17 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:39,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 403 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:55:39,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 10:55:39,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2024-10-11 10:55:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 50 states have internal predecessors, (55), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 10:55:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 143 transitions. [2024-10-11 10:55:39,853 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 143 transitions. Word has length 164 [2024-10-11 10:55:39,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:39,854 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 143 transitions. [2024-10-11 10:55:39,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:55:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 143 transitions. [2024-10-11 10:55:39,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 10:55:39,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:39,860 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:39,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:55:39,861 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:39,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1068649076, now seen corresponding path program 1 times [2024-10-11 10:55:39,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:39,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426921795] [2024-10-11 10:55:39,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:39,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:55:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:55:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 10:55:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:55:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 10:55:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 10:55:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 10:55:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 10:55:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 10:55:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 10:55:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 10:55:44,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:44,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426921795] [2024-10-11 10:55:44,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426921795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:44,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:44,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 10:55:44,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334710107] [2024-10-11 10:55:44,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:44,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:55:44,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:44,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:55:44,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:55:44,156 INFO L87 Difference]: Start difference. First operand 96 states and 143 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:55:44,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:44,461 INFO L93 Difference]: Finished difference Result 213 states and 311 transitions. [2024-10-11 10:55:44,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:55:44,462 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 165 [2024-10-11 10:55:44,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:44,464 INFO L225 Difference]: With dead ends: 213 [2024-10-11 10:55:44,464 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 10:55:44,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:55:44,469 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 59 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:44,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 245 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:55:44,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 10:55:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2024-10-11 10:55:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 57 states have internal predecessors, (64), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 10:55:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2024-10-11 10:55:44,497 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 165 [2024-10-11 10:55:44,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:44,498 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-10-11 10:55:44,498 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:55:44,499 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2024-10-11 10:55:44,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 10:55:44,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:44,502 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:44,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:55:44,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:44,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:44,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1068589494, now seen corresponding path program 1 times [2024-10-11 10:55:44,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:44,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260363652] [2024-10-11 10:55:44,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:44,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:55:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:55:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 10:55:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:55:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 10:55:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 10:55:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 10:55:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 10:55:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 10:55:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 10:55:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 10:55:48,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:48,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260363652] [2024-10-11 10:55:48,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260363652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:48,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:48,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 10:55:48,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679861199] [2024-10-11 10:55:48,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:48,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 10:55:48,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:48,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 10:55:48,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:55:48,748 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:55:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:48,995 INFO L93 Difference]: Finished difference Result 116 states and 165 transitions. [2024-10-11 10:55:48,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 10:55:48,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 165 [2024-10-11 10:55:48,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:48,998 INFO L225 Difference]: With dead ends: 116 [2024-10-11 10:55:48,998 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 10:55:48,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:55:48,999 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 30 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:49,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 304 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:55:49,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 10:55:49,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2024-10-11 10:55:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 57 states have internal predecessors, (64), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 10:55:49,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2024-10-11 10:55:49,016 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 165 [2024-10-11 10:55:49,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:49,017 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-10-11 10:55:49,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:55:49,017 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2024-10-11 10:55:49,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 10:55:49,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:49,019 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:49,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 10:55:49,019 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:49,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:49,020 INFO L85 PathProgramCache]: Analyzing trace with hash -388590706, now seen corresponding path program 1 times [2024-10-11 10:55:49,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:49,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642179197] [2024-10-11 10:55:49,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:49,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:55:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:55:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 10:55:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:55:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 10:55:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 10:55:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 10:55:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 10:55:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 10:55:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 10:55:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 10:55:52,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:52,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642179197] [2024-10-11 10:55:52,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642179197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:52,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:52,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 10:55:52,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490964355] [2024-10-11 10:55:52,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:52,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 10:55:52,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:52,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 10:55:52,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:55:52,355 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:55:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:52,636 INFO L93 Difference]: Finished difference Result 213 states and 311 transitions. [2024-10-11 10:55:52,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 10:55:52,637 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 165 [2024-10-11 10:55:52,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:52,639 INFO L225 Difference]: With dead ends: 213 [2024-10-11 10:55:52,639 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 10:55:52,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:55:52,641 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 31 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:52,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 345 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:55:52,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 10:55:52,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2024-10-11 10:55:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 10:55:52,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 146 transitions. [2024-10-11 10:55:52,656 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 146 transitions. Word has length 165 [2024-10-11 10:55:52,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:52,656 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 146 transitions. [2024-10-11 10:55:52,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:55:52,657 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 146 transitions. [2024-10-11 10:55:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 10:55:52,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:52,658 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:52,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 10:55:52,659 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:52,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:52,659 INFO L85 PathProgramCache]: Analyzing trace with hash -388531124, now seen corresponding path program 1 times [2024-10-11 10:55:52,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:52,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338384306] [2024-10-11 10:55:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:52,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:55:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:55:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 10:55:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:55:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 10:55:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 10:55:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 10:55:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 10:55:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 10:55:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 10:55:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 10:55:56,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:56,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338384306] [2024-10-11 10:55:56,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338384306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:56,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:56,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 10:55:56,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845998405] [2024-10-11 10:55:56,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:56,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 10:55:56,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:56,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 10:55:56,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:55:56,692 INFO L87 Difference]: Start difference. First operand 99 states and 146 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:55:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:57,262 INFO L93 Difference]: Finished difference Result 104 states and 151 transitions. [2024-10-11 10:55:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 10:55:57,263 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 165 [2024-10-11 10:55:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:57,264 INFO L225 Difference]: With dead ends: 104 [2024-10-11 10:55:57,264 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 10:55:57,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:55:57,265 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 12 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:57,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 324 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 10:55:57,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 10:55:57,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 10:55:57,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 10:55:57,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 10:55:57,266 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 165 [2024-10-11 10:55:57,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:57,266 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 10:55:57,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:55:57,267 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 10:55:57,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 10:55:57,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:55:57,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 10:55:57,273 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:57,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 10:55:57,805 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:55:57,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:55:57 BoogieIcfgContainer [2024-10-11 10:55:57,841 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:55:57,842 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:55:57,842 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:55:57,842 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:55:57,843 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:55:31" (3/4) ... [2024-10-11 10:55:57,845 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 10:55:57,848 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 10:55:57,854 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-11 10:55:57,856 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 10:55:57,857 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 10:55:57,857 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 10:55:57,963 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 10:55:57,963 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 10:55:57,963 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:55:57,964 INFO L158 Benchmark]: Toolchain (without parser) took 27955.10ms. Allocated memory was 165.7MB in the beginning and 685.8MB in the end (delta: 520.1MB). Free memory was 106.0MB in the beginning and 404.7MB in the end (delta: -298.7MB). Peak memory consumption was 221.3MB. Max. memory is 16.1GB. [2024-10-11 10:55:57,964 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:55:57,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.61ms. Allocated memory is still 165.7MB. Free memory was 106.0MB in the beginning and 134.1MB in the end (delta: -28.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 10:55:57,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.37ms. Allocated memory is still 165.7MB. Free memory was 134.1MB in the beginning and 130.2MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:55:57,965 INFO L158 Benchmark]: Boogie Preprocessor took 54.65ms. Allocated memory is still 165.7MB. Free memory was 130.2MB in the beginning and 125.9MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:55:57,965 INFO L158 Benchmark]: RCFGBuilder took 518.46ms. Allocated memory is still 165.7MB. Free memory was 125.9MB in the beginning and 102.9MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 10:55:57,965 INFO L158 Benchmark]: TraceAbstraction took 26834.47ms. Allocated memory was 165.7MB in the beginning and 685.8MB in the end (delta: 520.1MB). Free memory was 102.9MB in the beginning and 411.0MB in the end (delta: -308.1MB). Peak memory consumption was 380.6MB. Max. memory is 16.1GB. [2024-10-11 10:55:57,966 INFO L158 Benchmark]: Witness Printer took 121.40ms. Allocated memory is still 685.8MB. Free memory was 411.0MB in the beginning and 404.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 10:55:57,967 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 96.5MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.61ms. Allocated memory is still 165.7MB. Free memory was 106.0MB in the beginning and 134.1MB in the end (delta: -28.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.37ms. Allocated memory is still 165.7MB. Free memory was 134.1MB in the beginning and 130.2MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.65ms. Allocated memory is still 165.7MB. Free memory was 130.2MB in the beginning and 125.9MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 518.46ms. Allocated memory is still 165.7MB. Free memory was 125.9MB in the beginning and 102.9MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 26834.47ms. Allocated memory was 165.7MB in the beginning and 685.8MB in the end (delta: 520.1MB). Free memory was 102.9MB in the beginning and 411.0MB in the end (delta: -308.1MB). Peak memory consumption was 380.6MB. Max. memory is 16.1GB. * Witness Printer took 121.40ms. Allocated memory is still 685.8MB. Free memory was 411.0MB in the beginning and 404.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.2s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 229 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 229 mSDsluCounter, 2237 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1553 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 663 IncrementalHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 684 mSDtfsCounter, 663 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=5, InterpolantAutomatonStates: 58, 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, 8 MinimizatonAttempts, 82 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 22.9s InterpolantComputationTime, 1316 NumberOfCodeBlocks, 1316 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1308 ConstructedInterpolants, 0 QuantifiedInterpolants, 11948 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 12096/12096 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((0 == var_1_13) || (((((var_1_3 < var_1_2) || (((65536 * ((((unsigned) var_1_4 * 65535) + var_1_3) / 65536)) + var_1_1) < ((((unsigned) var_1_4 * 65535) + var_1_3) + 1))) && (var_1_3 <= ((int) var_1_4 + var_1_1))) && ((var_1_2 < (var_1_3 + 1)) || (((((((unsigned) var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1) < ((((unsigned) var_1_4 * 65535) + var_1_2) + 1)))) && ((((((unsigned) var_1_4 * 65535) + var_1_2) <= ((((((unsigned) var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1)) && ((var_1_3 + 1) <= var_1_2)) || (((((unsigned) var_1_4 * 65535) + var_1_3) <= ((65536 * ((((unsigned) var_1_4 * 65535) + var_1_3) / 65536)) + var_1_1)) && (var_1_2 <= var_1_3))))) RESULT: Ultimate proved your program to be correct! [2024-10-11 10:55:58,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE